A056132 - cp's OEIS frontend

A056132 Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.

n	a(n)
1	1
2	172
3	265
4	715
5	1407
6	2002
7	808
8	1241
9	139195
10	1570
11	2739
12	52614
13	4511
14	3953
15	52689
16	6986
17	178033207
18	52094
19	24485
20	10416
21	6118
22	7667
23	1889970
24	8283
25	52271
26	13143
27	10697
28	40934
29	32095
30	28260
31	1117797
32	13253
33	12987
34	24926
35	23276
36	14329

[1, 172, 265, 715, 1407, 2002, 808, 1241, 139195, 1570, 2739, 52614, 4511, 3953, 52689, 6986, 178033207, 52094, 24485, 10416, 6118, 7667, 1889970, 8283, 52271, 13143, 10697, 40934, 32095, 28260, 1117797, 13253, 12987, 24926, 23276, 14329]

cp's OEIS Frontend

A056132 Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.

Table of values

List of values