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.

A238450 Triangle read by rows: T(n,k) is the number of k’s in all partitions of n into an odd number of distinct parts.

Table of values

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

List of values

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