The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A157557 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A157557

Half the number of length n integer sequences with sum zero and sum of squares 1250.
(history; published version)

#4 by Russ Cox at Sat Mar 31 12:35:25 EDT 2012

AUTHOR

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

Discussion

Sat Mar 31

12:35

OEIS Server: https://oeis.org/edit/global/875

#3 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010

LINKS

R. H. Hardin, <a href="/A157557/b157557.txt">Table of n, a(n) for n=2..50</a>

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010

LINKS

Ron R. H. Hardin, <a href="b157557.txt">Table of n, a(n) for n=2..50</a>

KEYWORD

nonn,new

nonn

AUTHOR

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

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

NAME

Half the number of length n integer sequences with sum zero and sum of squares 1250.

DATA

1, 3, 222, 7810, 245715, 7887621, 271336828, 9598223664, 323149486005, 9653120522639, 265199107509930, 6875831133411318, 170878889034103705, 4105071237469192095, 95749849725794169816, 2169082695217727013712

OFFSET

2,2

LINKS

Ron Hardin, <a href="b157557.txt">Table of n, a(n) for n=2..50</a>

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

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) Mar 02 2009

STATUS

approved