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.

A115604 Triangle read by rows: T(n,k) is the number of partitions of n into odd parts in which the smallest part occurs k times (1<=k<=n).

Table of values

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

List of values

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