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.

A220400 Number of ways to write n as sum of at least 2 consecutive odd positive integers.

Table of values

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

List of values

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