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.

A238352 Irregular triangle T(n,k) read by rows: T(n,k) is the number of partitions p(1), p(2), ..., p(m) of n (as weakly ascending list of parts) with k parts p at position p (fixed points), n>=0, 0<=k<= (column index of last nonzero term in row n).

Table of values

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

List of values

[1, 0, 1, 1, 1, 1, 1, 1, 1, 4, 2, 3, 2, 3, 7, 0, 1, 3, 7, 5, 4, 14, 4, 5, 19, 3, 3, 8, 24, 9, 0, 1, 9, 32, 11, 4, 12, 46, 15, 4, 13, 60, 21, 7, 17, 85, 28, 1, 4, 22, 109, 28, 16, 0, 1, 28, 140, 51, 7, 5, 34, 179, 57, 26, 1, 42, 239, 74, 25, 5, 48, 300, 107, 24]