This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 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 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 A070723 A221213 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.

Last modified December 16 01:32 EST 2019. Contains 330013 sequences. (Running on oeis4.)