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.

A264403 Triangle read by rows: T(n,k) is the number of partitions of n in which the sum of the parts of multiplicity 1 is equal to k (0<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 2, 0, 1, 0, 2, 1, 1, 1, 1, 0, 3, 4, 0, 1, 1, 1, 0, 4, 2, 2, 1, 2, 1, 2, 0, 5, 6, 0, 2, 1, 3, 2, 2, 0, 6, 5, 2, 1, 4, 1, 4, 2, 3, 0, 8, 9, 1, 3, 2, 5, 2, 4, 3, 3, 0, 10, 7, 3, 3, 6, 2, 7, 2, 6, 3, 5, 0, 12, 16, 0, 4, 4, 7, 3, 8, 3, 7, 5, 5, 0, 15, 11, 6, 4, 8, 5, 9, 3, 12, 3, 10, 5, 7, 0, 18]