The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3
 1, 1, 1, 1, 8, 17, 55, 110, 184, 272, 384, 522, 681, 874, 1101, 1354 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS MAPLE A008782 := proc(n) local S, i, j, sumsq, npermut, p, per ; S := {} ; npermut := combinat[permute]([seq(i, i=0..n-1)]) ; for p from 1 to nops(npermut) do per := op(p, npermut) ; sumsq := 0 ; for i from 0 to n-1 do sumsq := sumsq + (add(op(1+(j mod n), per), j=i..i+2)) ^2 ; od ; S := S union {sumsq} ; od ; RETURN(nops(S)) ; end: for n from 1 to 20 do print(A008782(n)) ; od : # R. J. Mathar, Jun 18 2007 MATHEMATICA a[n_] := Module[{S, i, j, Sumsq, npermut, p, per}, S = {}; npermut = Permutations[Range[0, n-1]]; For[p = 1, p <= Length[npermut], p++, per = npermut[[p]]; Sumsq = 0; For[i = 0, i <= n-1, i++, Sumsq = Sumsq + Sum[per[[1+Mod[j, n] ]], {j, i, i+2}]^2]; S = S ~Union~ {Sumsq}]; Return[Length[S]]]; Table[Print[an = a[n]]; an, {n, 1, 10}] (* Jean-François Alcover, Jan 13 2014, translated from R. J. Mathar's Maple code *) CROSSREFS Cf. A007773. Sequence in context: A153873 A111325 A173056 * A146078 A097058 A186255 Adjacent sequences:  A008779 A008780 A008781 * A008783 A008784 A008785 KEYWORD nonn,more AUTHOR EXTENSIONS More terms from Reiner Martin (reinermartin(AT)hotmail.com), May 19 2001 a(11)-a(13) from Sean A. Irvine, May 05 2010 a(14)-a(16) from Donovan Johnson, Nov 30 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 06:42 EST 2021. Contains 349401 sequences. (Running on oeis4.)