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.

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

Table of values

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

List of values

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