A007773 - cp's OEIS frontend

A007773 For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.

n	a(n)
1	1
2	1
3	1
4	3
5	8
6	21
7	43
8	69
9	102
10	145
11	197
12	261
13	336
14	425
15	527
16	645
17	778
18	929
19	1097
20	1285
21	1492
22	1721
23	1971
24	2245
25	2542
26	2865
27	3213
28	3589
29	3992
30	4425
31	4887
32	5381
33	5906
34	6465
35	7057
36	7685
37	8348
38	9049
39	9787
40	10565
41	11382
42	12241
43	13141
44	14085
45	15072
46	16105

[1, 1, 1, 3, 8, 21, 43, 69, 102, 145, 197, 261, 336, 425, 527, 645, 778, 929, 1097, 1285, 1492, 1721, 1971, 2245, 2542, 2865, 3213, 3589, 3992, 4425, 4887, 5381, 5906, 6465, 7057, 7685, 8348, 9049, 9787, 10565, 11382, 12241, 13141, 14085, 15072, 16105]

cp's OEIS Frontend

A007773 For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.

Table of values

List of values