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.

A264405 Triangle read by rows: T(n,k) is the number of integer partitions of n having k repeated parts (each occurrence is counted).

Table of values

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

List of values

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