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.

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

List of values

[1, 1, 0, 1, 0, 1, 2, 0, 1, 0, 3, 0, 1, 0, 1, 4, 0, 2, 0, 1, 0, 6, 0, 2, 0, 1, 0, 2, 8, 0, 3, 0, 2, 0, 2, 0, 11, 0, 4, 0, 3, 0, 2, 0, 2, 15, 0, 5, 0, 4, 0, 4, 0, 2, 0, 19, 0, 7, 0, 6, 0, 5, 0, 2, 0, 3, 25, 0, 9, 0, 8, 0, 7, 0, 4, 0, 3, 0, 34, 0, 11, 0, 10, 0, 10, 0, 5, 0, 3, 0, 4]