login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157542 Half the number of length n integer sequences with sum zero and sum of squares 200. 1
1, 3, 42, 930, 17685, 265041, 3668483, 44840097, 529728300, 5955342987, 65311345275, 699155920398, 7170690213960, 69964606094670, 652763403442422, 5868431782886486, 51137730082075059, 433379839761592641 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
FORMULA
[cache enabling] count(n,s,ss)->count(n,t,tt) where t=s mod n, q=(t-s)/n, tt=ss+2*q*s+n*q^2; count(n,t,tt)=sum[i^2<=tt]{ count(n-1,t-i,tt-i^2) }. a(n)=count(n,0,200)/2.
CROSSREFS
Sequence in context: A366006 A366010 A206820 * A078601 A268621 A218308
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 20:32 EDT 2024. Contains 372388 sequences. (Running on oeis4.)