For any circular arrangement of 0..n-1, let S = sum of squares of every sum of three contiguous numbers; then a(n) = # of distinct values of S.
A008782
For any circular arrangement of 0..n-1, let S = sum of squares of every sum of three contiguous numbers; then a(n) = # of distinct values of S.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =8a(5) =17a(6) =55a(7) =110a(8) =184a(9) =272a(10) =384a(11) =522a(12) =681a(13) =874a(14) =1101a(15) =1354
External references
- oeis: A008782