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.

A131576 Number of ways to represent n as a sum of an even number of consecutive integers.

Table of values

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

List of values

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