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.

A373029 Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) is the number of distinct partitions p of n such that max(p) is a multiple of k.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 1, 0, 3, 1, 1, 1, 1, 0, 4, 2, 2, 1, 1, 1, 0, 5, 3, 1, 2, 1, 1, 1, 0, 6, 3, 1, 2, 2, 1, 1, 1, 0, 8, 4, 3, 2, 2, 2, 1, 1, 1, 0, 10, 5, 3, 2, 3, 2, 2, 1, 1, 1, 0, 12, 6, 4, 2, 3, 3, 2, 2, 1, 1, 1, 0, 15, 7, 6, 3, 3, 4, 3, 2, 2, 1, 1, 1, 0, 18, 9, 6, 4, 3, 4, 4, 3, 2, 2, 1, 1, 1]