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.

A117278 Triangle read by rows: T(n,k) is the number of partitions of n into k prime parts (n>=2, 1<=k<=floor(n/2)).

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 0, 2, 1, 1, 1, 1, 0, 2, 2, 1, 0, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 0, 2, 1, 3, 2, 1, 1, 0, 1, 3, 2, 3, 2, 1, 0, 2, 2, 3, 3, 2, 1, 1, 1, 0, 4, 3, 3, 3, 2, 1, 0, 2, 2, 4, 3, 4, 2, 1, 1, 1, 1, 3, 4, 5, 3, 3, 2, 1, 0, 2, 2, 6, 4, 4, 4, 2, 1, 1, 0, 1, 5, 3, 6]