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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157568 Half the number of length n integer sequences with sum zero and sum of squares 2592. 1
1, 3, 54, 6710, 552975, 42285705, 2331601391, 101037868356, 4170874974720, 169800684016755, 6716524310262195, 256753303252023825, 9424676123728329646, 331044899193112524525, 11129765080736905244370, 360217055543666912443944 (list; graph; refs; listen; history; text; 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,2592)/2.

CROSSREFS

Sequence in context: A158103 A174579 A171739 * A156911 A214006 A154604

Adjacent sequences:  A157565 A157566 A157567 * A157569 A157570 A157571

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 27 19:59 EDT 2020. Contains 338036 sequences. (Running on oeis4.)