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.

A061198 Square table by antidiagonals where T(n,k) is number of partitions of k where no part appears more than n times; also partitions of k where no parts are multiples of (n+1).

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 2, 1, 1, 0, 2, 2, 2, 1, 1, 0, 3, 4, 3, 2, 1, 1, 0, 4, 5, 4, 3, 2, 1, 1, 0, 5, 7, 6, 5, 3, 2, 1, 1, 0, 6, 9, 9, 6, 5, 3, 2, 1, 1, 0, 8, 13, 12, 10, 7, 5, 3, 2, 1, 1, 0, 10, 16, 16, 13, 10, 7, 5, 3, 2, 1, 1, 0, 12, 22, 22, 19, 14, 11, 7, 5, 3, 2, 1, 1, 0, 15, 27, 29, 25, 20, 14, 11, 7, 5, 3, 2, 1, 1]