Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A157587
%S A157587 1,3,462,41230,2595765,186323823,13994329244,1089068168952,
%T A157587 80599569668955,5296880405561547,320164718544367950,18262041337319290446,
%U A157587 998477188502752352485,52770671879708445120045,2707901917377956941817496
%N A157587 Half the number of length n integer sequences with sum zero and sum of 
               squares 6050.
%H A157587 Ron Hardin, <a href="b157587.txt">Table of n, a(n) for n=2..50</a>
%F A157587 [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,6050)/2.
%Y A157587 Sequence in context: A139999 A157601 A094454 this_sequence A054702 A140015 
               A045616
%Y A157587 Adjacent sequences: A157584 A157585 A157586 this_sequence A157588 A157589 
               A157590
%K A157587 nonn
%O A157587 2,2
%A A157587 Ron Hardin (rhhardin(AT)att.net) Mar 02 2009

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research