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.

A229961 T(n,k) is the number of partitions in each run k of strictly increasing numbers of 2 X 2 squares in the list of partitions of n^2 into squares, where partition sorting order is ascending with larger squares taking higher precedence; irregular triangle T(n,k), 1 <= n, 1 <= k <= A227940(n), read by rows.

Table of values

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

List of values

[1, 2, 3, 1, 5, 2, 1, 7, 5, 2, 3, 1, 1, 10, 7, 5, 3, 1, 6, 3, 1, 2, 3, 1, 1, 13, 11, 8, 6, 4, 2, 9, 7, 4, 2, 5, 3, 1, 7, 4, 2, 3, 4, 2, 1, 17, 14, 12, 10, 8, 5, 3, 1, 13, 10, 8, 6, 4, 1, 9, 6, 4, 2, 5, 2, 1, 10, 8, 6, 4, 1, 6, 4, 2, 2, 4, 2, 8, 5, 3, 1, 4, 1, 1, 4, 2, 1]