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.

A263232 Triangle read by rows: T(n,k) is the number of partitions of n having exactly k parts equal to 3 (n >= 0, 0 <= k <= floor(n/3)).

Table of values

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

List of values

[1, 1, 2, 2, 1, 4, 1, 5, 2, 8, 2, 1, 10, 4, 1, 15, 5, 2, 19, 8, 2, 1, 27, 10, 4, 1, 34, 15, 5, 2, 47, 19, 8, 2, 1, 59, 27, 10, 4, 1, 79, 34, 15, 5, 2, 99, 47, 19, 8, 2, 1, 130, 59, 27, 10, 4, 1, 162, 79, 34, 15, 5, 2, 209, 99, 47, 19, 8, 2, 1, 259, 130, 59, 27, 10, 4, 1]