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.

A276433 Irregular triangle read by rows: T(n,k) is the number of partitions of n having k distinct parts i of multiplicity i+1 (n>=0).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 4
6 1
7 6
8 1
9 8
10 3
11 12
12 3
13 18
14 3
15 1
16 24
17 6
18 32
19 10
20 45
21 10
22 1
23 59
24 17
25 1
26 79
27 21
28 1
29 104
30 28
31 3
32 137
33 37
34 2
35 177
36 50
37 4
38 229
39 64
40 4
41 295
42 82
43 8
44 377
45 105
46 8
47 477
48 139
49 10
50 1
51 605
52 174
53 13
54 761
55 220
56 21
57 956
58 275
59 24
60 1193
61 350
62 31
63 1

List of values

[1, 1, 1, 1, 3, 4, 1, 6, 1, 8, 3, 12, 3, 18, 3, 1, 24, 6, 32, 10, 45, 10, 1, 59, 17, 1, 79, 21, 1, 104, 28, 3, 137, 37, 2, 177, 50, 4, 229, 64, 4, 295, 82, 8, 377, 105, 8, 477, 139, 10, 1, 605, 174, 13, 761, 220, 21, 956, 275, 24, 1193, 350, 31, 1]