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.

A333365 T(n,k) is the number of times that prime(k) is the least part in a partition of n into prime parts; triangle T(n,k), n >= 0, 1 <= k <= max(1,A000720(A331634(n))), read by rows.

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 2, 0, 0, 1, 2, 1, 3, 1, 3, 1, 1, 4, 1, 0, 0, 1, 5, 1, 1, 6, 2, 0, 0, 0, 1, 7, 2, 0, 1, 9, 2, 1, 10, 3, 1, 12, 3, 1, 0, 0, 0, 1, 14, 3, 1, 1, 17, 4, 1, 0, 0, 0, 0, 1, 19, 5, 1, 1, 23, 5, 1, 1, 26, 6, 2, 0, 1, 30, 7, 2, 0, 0, 0, 0, 0, 1]