A056131 - cp's OEIS frontend

A056131 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 x.

n	a(n)
1	1
2	27
3	27
4	91
5	151
6	225
7	31
8	67
9	14037
10	47
11	119
12	4177
13	165
14	103
15	3599
16	291
17	11467887
18	3089
19	1297
20	379
21	57
22	131
23	110311
24	153
25	2637
26	353
27	163
28	1679
29	1211
30	995
31	54863
32	105
33	43
34	615
35	439
36	15
37	12955
38	2263
39	11661
40	1867
41	1281
42	1433
43	46671
44	303
45	21139
46	324545
47	4159
48	343803

[1, 27, 27, 91, 151, 225, 31, 67, 14037, 47, 119, 4177, 165, 103, 3599, 291, 11467887, 3089, 1297, 379, 57, 131, 110311, 153, 2637, 353, 163, 1679, 1211, 995, 54863, 105, 43, 615, 439, 15, 12955, 2263, 11661, 1867, 1281, 1433, 46671, 303, 21139, 324545, 4159, 343803]

cp's OEIS Frontend

A056131 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 x.

Table of values

List of values