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.

A117274 Triangle read by rows: T(n,k) is the number of partitions of n with no even part repeated and having k 1's (n>=0, 0<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 3, 2, 1, 1, 1, 0, 1, 3, 3, 2, 1, 1, 1, 0, 1, 4, 3, 3, 2, 1, 1, 1, 0, 1, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 9, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 12, 9, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 14, 12, 9, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0]