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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157561 Half the number of length n integer sequences with sum zero and sum of squares 1682. 1
1, 3, 186, 8710, 366285, 14870583, 574288652, 23199133896, 906030228645, 31596296548135, 1008864177035154, 30341990819899122, 874376529563919655, 24366254356588107705, 659305049442735042120, 17325808811806633829408 (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,1682)/2.

CROSSREFS

Sequence in context: A103503 A203562 A198701 * A157590 A157236 A058856

Adjacent sequences:  A157558 A157559 A157560 * A157562 A157563 A157564

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 17 06:24 EST 2012. Contains 205994 sequences.