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.

A382025 Triangle read by rows: T(n, k) is the number of partitions of n with at most k parts where 0 <= k <= n, and each part is one of three kinds.

Table of values

n a(n)
0 1
1 0
2 3
3 0
4 3
5 9
6 0
7 3
8 12
9 22
10 0
11 3
12 18
13 36
14 51
15 0
16 3
17 21
18 57
19 87
20 108
21 0
22 3
23 27
24 82
25 148
26 193
27 221
28 0
29 3
30 30
31 111
32 225
33 330
34 393
35 429
36 0
37 3
38 36
39 144
40 333
41 528
42 681
43 765
44 810
45 0
46 3
47 39
48 184
49 460
50 808
51 1106
52 1316
53 1424
54 1479
55 0
56 3
57 45
58 225
59 630
60 1182
61 1740
62 2163
63 2439
64 2574
65 2640

List of values

[1, 0, 3, 0, 3, 9, 0, 3, 12, 22, 0, 3, 18, 36, 51, 0, 3, 21, 57, 87, 108, 0, 3, 27, 82, 148, 193, 221, 0, 3, 30, 111, 225, 330, 393, 429, 0, 3, 36, 144, 333, 528, 681, 765, 810, 0, 3, 39, 184, 460, 808, 1106, 1316, 1424, 1479, 0, 3, 45, 225, 630, 1182, 1740, 2163, 2439, 2574, 2640]