login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157563 Half the number of length n integer sequences with sum zero and sum of squares 1922. 1
1, 9, 198, 9930, 447345, 19373781, 801643164, 34613610228, 1445069106945, 53870000270295, 1838679236576886, 59112727361906010, 1820954720583759943, 54244177130219463765, 1568969312068377795960, 44074283494841644862536 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

LINKS

R. H. Hardin, Table of n, a(n) for n=2..50

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,1922)/2.

CROSSREFS

Sequence in context: A180778 A110807 A019566 * A003026 A157594 A196910

Adjacent sequences:  A157560 A157561 A157562 * A157564 A157565 A157566

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Mar 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:42 EST 2012. Contains 205907 sequences.