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.

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

Table of values

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

List of values

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