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.

A382045 Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n.

Table of values

n a(n)
0 1
1 0
2 3
3 0
4 6
5 12
6 0
7 10
8 28
9 38
10 0
11 15
12 66
13 102
14 117
15 0
16 21
17 126
18 249
19 309
20 330
21 0
22 28
23 236
24 562
25 788
26 878
27 906
28 0
29 36
30 396
31 1167
32 1845
33 2205
34 2331
35 2367
36 0
37 45
38 651
39 2292
40 4128
41 5289
42 5814
43 5982
44 6027
45 0
46 55
47 1001
48 4272
49 8703
50 12106
51 13881
52 14602
53 14818
54 14873
55 0
56 66
57 1512
58 7608
59 17634
60 26616
61 32088
62 34608
63 35556
64 35826
65 35892

List of values

[1, 0, 3, 0, 6, 12, 0, 10, 28, 38, 0, 15, 66, 102, 117, 0, 21, 126, 249, 309, 330, 0, 28, 236, 562, 788, 878, 906, 0, 36, 396, 1167, 1845, 2205, 2331, 2367, 0, 45, 651, 2292, 4128, 5289, 5814, 5982, 6027, 0, 55, 1001, 4272, 8703, 12106, 13881, 14602, 14818, 14873, 0, 66, 1512, 7608, 17634, 26616, 32088, 34608, 35556, 35826, 35892]