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.

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.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =8a(5) =21a(6) =43a(7) =69a(8) =102a(9) =145a(10) =197a(11) =261a(12) =336a(13) =425a(14) =527a(15) =645a(16) =778a(17) =929a(18) =1097a(19) =1285a(20) =1492a(21) =1721a(22) =1971a(23) =2245a(24) =2542a(25) =2865a(26) =3213a(27) =3589a(28) =3992a(29) =4425

External references