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.

A126442 Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 4
6 5
7 5
8 7
9 11
10 15
11 7
12 12
13 21
14 36
15 52
16 11
17 19
18 38
19 74
20 135
21 203
22 15
23 30
24 64
25 141
26 296
27 566
28 877
29 22
30 45
31 105
32 250
33 592
34 1315
35 2610
36 4140
37 30
38 67
39 165
40 426
41 1098
42 2752
43 6393
44 13082
45 21147
46 42
47 97
48 254
49 696
50 1940
51 5317
52 13960
53 33645
54 70631
55 115975

List of values

[1, 2, 2, 3, 4, 5, 5, 7, 11, 15, 7, 12, 21, 36, 52, 11, 19, 38, 74, 135, 203, 15, 30, 64, 141, 296, 566, 877, 22, 45, 105, 250, 592, 1315, 2610, 4140, 30, 67, 165, 426, 1098, 2752, 6393, 13082, 21147, 42, 97, 254, 696, 1940, 5317, 13960, 33645, 70631, 115975]