id:A053721 - OEIS Search Results

Search: id:A053721

Displaying 1-1 of 1 results found.

page 1

Let Py(n)=A000330(n)=nth 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.

+0
5

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; listen)

	OFFSET	`0,1`
	COMMENT	`i values are A054245 and j values are A054246.`
	EXAMPLE	`Py(55) = 56980 = Py(45) + Py(42); Py(70) = 116795 = Py(69) + Py(24);`
	CROSSREFS	`A000330.` `Sequence in context: A030434 A033362 A033976 this_sequence A070723 A165863 A008941` `Adjacent sequences: A053718 A053719 A053720 this_sequence A053722 A053723 A053724`
	KEYWORD	`easy,nice,nonn`
	AUTHOR	`Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 11 2000`

page 1

Search completed in 0.002 seconds

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.

AT&T Labs Research