A053719 -id:A053719

Search: a053719 -id:a053719

Displaying 1-2 of 2 results found.

page 1

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.

+10
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.

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

A053720

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 j values.

+10
2

45, 69, 145, 212, 225, 224, 344, 395, 377, 522, 643, 715, 845, 909, 1082, 1292, 1479, 1547, 1363, 1830, 2290, 2204, 2315, 3017, 3195, 2804, 3293, 4035, 3642, 3394, 4047, 5084, 5309, 5550, 8406, 8631, 8697, 8073, 8728, 9940, 9005, 10804, 10471, 11571