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.

A061199 Upper right triangle read by columns where T(n,k), with k >= n, is the 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 2
6 0
7 2
8 2
9 3
10 0
11 2
12 4
13 4
14 5
15 0
16 3
17 5
18 6
19 6
20 7
21 0
22 4
23 7
24 9
25 10
26 10
27 11
28 0
29 5
30 9
31 12
32 13
33 14
34 14
35 15
36 0
37 6
38 13
39 16
40 19
41 20
42 21
43 21
44 22
45 0
46 8
47 16
48 22
49 25
50 27
51 28
52 29
53 29
54 30
55 0
56 10
57 22
58 29
59 34
60 37
61 39
62 40
63 41
64 41
65 42
66 0
67 12
68 27
69 38
70 44
71 49
72 51
73 53
74 54
75 55
76 55
77 56
78 0
79 15
80 36

List of values

[1, 0, 1, 0, 1, 2, 0, 2, 2, 3, 0, 2, 4, 4, 5, 0, 3, 5, 6, 6, 7, 0, 4, 7, 9, 10, 10, 11, 0, 5, 9, 12, 13, 14, 14, 15, 0, 6, 13, 16, 19, 20, 21, 21, 22, 0, 8, 16, 22, 25, 27, 28, 29, 29, 30, 0, 10, 22, 29, 34, 37, 39, 40, 41, 41, 42, 0, 12, 27, 38, 44, 49, 51, 53, 54, 55, 55, 56, 0, 15, 36]