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.

A255212 Number A(n,k) of partitions of n^2 into at most k square parts; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 2, 2, 1, 1, 0, 1, 1, 2, 2, 1, 2, 1, 0, 1, 1, 2, 2, 2, 2, 1, 1, 0, 1, 1, 2, 3, 3, 3, 2, 1, 1, 0, 1, 1, 2, 3, 3, 4, 4, 2, 1, 1, 0, 1, 1, 2, 3, 4, 5, 5, 4, 1, 1, 1, 0, 1, 1, 2, 4, 5, 7, 9, 6, 2, 4, 2, 1, 0]