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.

A299730 Irregular triangle read by rows: T(n,k) is the number of partitions of 3*n having exactly k prime parts; n >= 0, 0 <= k <= floor( 3*n / 2 ).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 3
6 1
7 6
8 9
9 8
10 5
11 2
12 12
13 20
14 19
15 14
16 8
17 3
18 1
19 19
20 41
21 42
22 34
23 21
24 12
25 5
26 2
27 37
28 72
29 88
30 74
31 53
32 31
33 18
34 8
35 3
36 1
37 58
38 136
39 161
40 155
41 115
42 77
43 46
44 25
45 12
46 5
47 2
48 102
49 226
50 307
51 291
52 241
53 168
54 110
55 65
56 35
57 18
58 8
59 3
60 1

List of values

[1, 1, 2, 3, 4, 3, 1, 6, 9, 8, 5, 2, 12, 20, 19, 14, 8, 3, 1, 19, 41, 42, 34, 21, 12, 5, 2, 37, 72, 88, 74, 53, 31, 18, 8, 3, 1, 58, 136, 161, 155, 115, 77, 46, 25, 12, 5, 2, 102, 226, 307, 291, 241, 168, 110, 65, 35, 18, 8, 3, 1]