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.

A062862 Number of ways n can be written as the sum of squares of consecutive numbers (possibly including squares of negative numbers).

Table of values

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

List of values

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