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.

A264032 Triangle read by rows: T(n,k) (n>=0, k>=n+1) is the number of integer partitions of n containing exactly k partitions.

Table of values

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

List of values

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