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.

A061197 Table by antidiagonals T(n,k) of number of partitions of k where the largest part is less than or equal to n and where there are no more than two of any particular sized part.

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 2, 1, 1, 0, 0, 1, 2, 1, 1, 0, 0, 2, 2, 2, 1, 1, 0, 0, 1, 3, 2, 2, 1, 1, 0, 0, 1, 3, 4, 2, 2, 1, 1, 0, 0, 0, 3, 4, 4, 2, 2, 1, 1, 0, 0, 0, 3, 5, 5, 4, 2, 2, 1, 1, 0, 0, 0, 3, 5, 6, 5, 4, 2, 2, 1, 1, 0, 0, 0, 2, 7, 7, 7, 5, 4, 2, 2, 1, 1, 0, 0, 0, 2, 6, 9, 8, 7, 5, 4, 2, 2, 1, 1]