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!)
A053721 Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values. 6
42, 24, 50, 126, 124, 212, 136, 189, 304, 439, 461, 145, 375, 399, 219, 742, 417, 742, 1239, 1100, 1058, 1474, 1569, 434, 1126, 2669, 3076, 580, 2650, 3170, 3531, 3921, 3647, 4525, 3484, 963, 3317, 5596, 5559, 3503, 6969, 1205, 6083, 5323, 6962, 4088 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

i values are A053719 and j values are A053720.

LINKS

Table of n, a(n) for n=0..45.

EXAMPLE

Py(55) = 56980 = Py(45) + Py(42); Py(70) = 116795 = Py(69) + Py(24);

CROSSREFS

Cf. A000330, A053719, A073720.

Sequence in context: A033362 A033976 A236684 * A195750 A331483 A342151

Adjacent sequences:  A053718 A053719 A053720 * A053722 A053723 A053724

KEYWORD

easy,nice,nonn

AUTHOR

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 11 2000

EXTENSIONS

Crossrefs in comments corrected by Jean-Fran├žois Alcover, Oct 17 2012

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 May 12 10:54 EDT 2021. Contains 343821 sequences. (Running on oeis4.)