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.

A276422 Triangle read by rows: T(n,k) is the number of partitions of n for which the sum of its odd singletons is k (0<=k<=n). A singleton in a partition is a part that occurs exactly once.

Table of values

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

List of values

[1, 0, 1, 2, 0, 0, 1, 1, 0, 1, 4, 0, 0, 0, 1, 2, 2, 0, 2, 0, 1, 8, 0, 0, 1, 1, 0, 1, 4, 4, 0, 4, 0, 2, 0, 1, 14, 0, 0, 2, 2, 1, 1, 0, 2, 9, 6, 0, 7, 0, 4, 0, 2, 0, 2, 24, 1, 0, 4, 3, 2, 2, 1, 3, 0, 2, 16, 10, 0, 12, 0, 8, 0, 4, 1, 3, 0, 2, 41, 1, 0, 7, 5, 4, 4, 2, 6, 1, 3, 0, 3, 28, 16, 0, 20, 0, 14, 0, 8, 2, 6, 1, 3, 0, 3]