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.

A116929 Triangle read by rows: T(n,k) is the number of partitions of n into odd parts such that the sum of the parts, counted without multiplicities, is equal to k (n>=1, k>=1).

Table of values

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

List of values

[1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 1, 1, 1, 0, 0, 2, 0, 1, 0, 2, 1, 0, 1, 2, 0, 1, 0, 1, 2, 1, 0, 0, 3, 1, 1, 0, 1, 1, 2, 1, 0, 0, 3, 0, 2, 0, 2, 1, 1, 2, 1, 0, 1, 3, 0, 2, 0, 1, 2, 1, 1, 3, 1, 0, 0, 4, 0, 2, 0, 2, 2, 2, 1, 1, 3, 1, 0, 0, 4, 0, 2, 1, 2, 3, 1, 2, 1, 2, 3]