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.

A264391 Triangle read by rows: T(n,k) is the number of partitions of n having k perfect cube parts (0<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 1, 1, 0, 1, 4, 2, 2, 1, 1, 0, 1, 4, 4, 2, 2, 1, 1, 0, 1, 6, 5, 4, 2, 2, 1, 1, 0, 1, 8, 6, 5, 4, 2, 2, 1, 1, 0, 1, 11, 9, 6, 5, 4, 2, 2, 1, 1, 0, 1, 13, 12, 9, 6, 5, 4, 2, 2, 1, 1, 0, 1, 19, 15, 12, 9, 6, 5, 4, 2, 2, 1, 1, 0, 1]