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.

A116856 Triangle read by rows: T(n,k) is the number of partitions of n into odd parts such that the smallest part is k (n>=1, k>=1).

Table of values

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

List of values

[1, 1, 1, 0, 1, 2, 2, 0, 0, 0, 1, 3, 0, 1, 4, 0, 0, 0, 0, 0, 1, 5, 0, 1, 6, 0, 1, 0, 0, 0, 0, 0, 1, 8, 0, 1, 0, 1, 10, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 12, 0, 2, 0, 1, 15, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 18, 0, 2, 0, 1, 0, 1, 22, 0, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 27, 0, 3, 0, 1, 0, 1, 32, 0, 4, 0, 1, 0]