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.

A365676 Triangle read by rows: T(n, k) is the number of partitions of n having exactly k distinct part sizes, for 0 <= k <= n.

Table of values

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

List of values

[1, 0, 1, 0, 2, 0, 0, 2, 1, 0, 0, 3, 2, 0, 0, 0, 2, 5, 0, 0, 0, 0, 4, 6, 1, 0, 0, 0, 0, 2, 11, 2, 0, 0, 0, 0, 0, 4, 13, 5, 0, 0, 0, 0, 0, 0, 3, 17, 10, 0, 0, 0, 0, 0, 0, 0, 4, 22, 15, 1, 0, 0, 0, 0, 0, 0, 0, 2, 27, 25, 2, 0, 0, 0, 0, 0, 0, 0, 0, 6, 29, 37, 5, 0, 0, 0, 0, 0, 0, 0, 0]