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.

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

List of values

[1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 3, 1, 0, 0, 0, 0, 1, 4, 1, 0, 0, 0, 0, 0, 1, 5, 1, 1, 0, 0, 0, 0, 0, 1, 6, 2, 1, 0, 0, 0, 0, 0, 0, 1, 8, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 10, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 12, 3, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 15, 4, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]