|
Search: id:A083527
|
|
|
| A083527 |
|
a(n) is the number of times that sums 1+-4+-9+-16+-...+-n^2 of the first n squares is zero. There are 2^(n-1) choices for the sign patterns. |
|
+0
6
|
|
| 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 5, 0, 0, 43, 57, 0, 0, 239, 430, 0, 0, 2904, 5419, 0, 0, 27813, 50213, 0, 0, 348082, 649300, 0, 0, 3913496, 7287183, 0, 0, 50030553, 93696497, 0, 0, 611793542, 1161079907, 0, 0, 8009933135, 15176652567, 0, 0, 103683431845
(list; graph; listen)
|
|
|
OFFSET
|
1,12
|
|
|
COMMENT
|
The frequency of each possible sum is computed by the Mathematica program without explicitly computing the individual sums.
a(n) is the maximal number of subsets of the first n squares that share the same sum. Cf. A025591, A083309.
a(n)=0 when n==1 or 2 (mod 4).
|
|
LINKS
|
T. D. Noe, Extremal Sums of Sequences
|
|
FORMULA
|
a(n) is half the coefficient of x^0 in the product_{k=1..n} x^(k^2)+x^(k^-2).
Equals A158092/2.
|
|
EXAMPLE
|
a(7) = 1 because there is only one sign pattern of the first seven squares that yields zero: 1+4-9+16-25-36+49.
|
|
MATHEMATICA
|
d={1, 1}; nMax=60; zeroLst={0}; Do[p=n^2; d=PadLeft[d, Length[d]+p]+PadRight[d, Length[d]+p]; If[1==Mod[Length[d], 2], AppendTo[zeroLst, d[[(Length[d]+1)/2]]], AppendTo[zeroLst, 0]], {n, 2, nMax}]; zeroLst/2
p = 1; t = {}; Do[p = Expand[p(x^(n^2) + x^(-n^2))]; AppendTo[t, Select[p, NumberQ[ # ] &]/2], {n, 51}]; t (from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 31 2005)
|
|
CROSSREFS
|
Cf. A015818, A063865, A113263, A158092.
Sequence in context: A099222 A019178 A075534 this_sequence A113038 A082512 A068385
Adjacent sequences: A083524 A083525 A083526 this_sequence A083528 A083529 A083530
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Apr 29 2003
|
|
|
Search completed in 0.002 seconds
|
