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.

A328361 Triangle read by rows: T(n,k) is the total number of k's in all partitions of n into consecutive parts, (1 <= k <= n).

Table of values

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

List of values

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