cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A227009 Irregular triangle read by rows: T(n,k) is the number of partitions of an n X n square lattice into squares that contain k nodes unconnected to any of their neighbors, considering only the number of parts.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 0
7 0
8 1
9 1
10 1
11 1
12 1
13 2
14 0
15 0
16 0
17 0
18 1
19 1
20 1
21 1
22 1
23 2
24 1
25 1
26 1
27 0
28 1
29 0
30 0
31 0
32 0
33 0
34 0
35 1
36 1
37 1
38 1
39 1
40 2
41 2
42 2
43 2
44 3
45 4
46 2
47 2
48 2
49 2
50 1
51 0
52 2
53 0
54 0
55 0
56 0
57 0
58 0
59 0
60 0
61 1
62 1
63 1
64 1
65 1
66 2
67 2
68 2
69 2
70 3
71 4
72 3
73 3
74 4
75 4
76 4
77 3
78 4
79 3
80 2
81 2
82 2
83 2
84 0
85 0
86 0
87 1
88 0
89 0
90 0
91 0
92 0
93 0
94 0
95 0
96 0
97 0
98 1

List of values

[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 2, 2, 2, 2, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 3, 3, 4, 4, 4, 3, 4, 3, 2, 2, 2, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]