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.

A382041 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 four kinds.

Table of values

n a(n)
0 1
1 0
2 4
3 0
4 4
5 14
6 0
7 4
8 20
9 40
10 0
11 4
12 30
13 70
14 105
15 0
16 4
17 36
18 116
19 196
20 252
21 0
22 4
23 46
24 170
25 350
26 490
27 574
28 0
29 4
30 52
31 236
32 556
33 896
34 1120
35 1240
36 0
37 4
38 62
39 310
40 845
41 1505
42 2079
43 2415
44 2580
45 0
46 4
47 68
48 400
49 1200
50 2400
51 3584
52 4480
53 4960
54 5180
55 0
56 4
57 78
58 494
59 1670
60 3626
61 5910
62 7842
63 9162
64 9822
65 10108

List of values

[1, 0, 4, 0, 4, 14, 0, 4, 20, 40, 0, 4, 30, 70, 105, 0, 4, 36, 116, 196, 252, 0, 4, 46, 170, 350, 490, 574, 0, 4, 52, 236, 556, 896, 1120, 1240, 0, 4, 62, 310, 845, 1505, 2079, 2415, 2580, 0, 4, 68, 400, 1200, 2400, 3584, 4480, 4960, 5180, 0, 4, 78, 494, 1670, 3626, 5910, 7842, 9162, 9822, 10108]