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.

A366851 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n such that the sum of primes indexed by all parts greater than one is k.

Table of values

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

List of values

[1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 0, 2, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 2, 2, 2, 2, 1, 1, 0, 0, 1]