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.

A233292 Triangle read by rows: T(n,k) is the number of partitions of n into at most four parts in which no part exceeds k, 0 <= k <= n.

Table of values

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

List of values

[1, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 3, 4, 5, 0, 0, 2, 4, 5, 6, 0, 0, 2, 5, 7, 8, 9, 0, 0, 1, 4, 7, 9, 10, 11, 0, 0, 1, 4, 8, 11, 13, 14, 15, 0, 0, 0, 3, 7, 11, 14, 16, 17, 18, 0, 0, 0, 2, 7, 12, 16, 19, 21, 22, 23, 0, 0, 0, 1, 5, 11, 16, 20, 23, 25, 26, 27, 0, 0, 0, 1, 5, 11, 18, 23, 27, 30, 32, 33, 34]