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.

A366525 Irregular triangular array read by rows: T(n,k) = number of partitions p of n such that f(p) = k >= 0, where f is defined in Comments.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 3, 4, 3, 3, 6, 2, 6, 6, 3, 5, 9, 5, 3, 7, 9, 9, 4, 1, 7, 13, 12, 6, 4, 10, 12, 15, 12, 5, 2, 7, 16, 19, 16, 12, 5, 2, 12, 16, 24, 22, 18, 6, 3, 11, 20, 28, 29, 24, 14, 6, 3, 12, 19, 31, 34, 36, 24, 13, 4, 3, 12, 23, 36, 42, 50, 30, 25, 8, 4]