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.

A352269 Irregular triangle read by rows: T(n,k) is the number of parts in the partition of n into 2*k-1 consecutive parts, 1 <= k <= A351846(n). T(n,k) = 0 if no such partition exists.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 3, 1, 0, 1, 0, 1, 3, 1, 0, 1, 0, 1, 3, 1, 0, 1, 0, 1, 3, 5, 1, 0, 0, 1, 0, 0, 1, 3, 0, 1, 0, 0, 1, 0, 5, 1, 3, 0, 1, 0, 0, 1, 0, 0, 1, 3, 0, 1, 0, 5, 1, 0, 0, 1, 3, 0, 1, 0, 0, 7, 1, 0, 0, 0, 1, 3, 5, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 3, 0, 0, 1, 0, 0, 0, 1, 0, 5, 7, 1, 3, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0]