id:A053719 - OEIS Search Results

Search: id:A053719

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

+0
1

55, 70, 147, 226, 237, 275, 351, 409, 434, 610, 714, 717, 869, 934, 1085, 1369, 1490, 1602, 1643, 1954, 2363, 2405, 2534, 3020, 3241, 3450, 4017, 4039, 4060, 4140, 4796, 5766, 5830, 6412, 8601, 8635, 8855, 8885, 9423, 10083, 10224, 10809, 11115, 11935 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`j values are A054246 and k values are A054247`
	EXAMPLE	`Py(55) = 56980 = Py(45) + Py(42); Py(70) = 116795 = Py(69) + Py(24);`
	CROSSREFS	`A000330.` `Sequence in context: A116055 A068898 A068899 this_sequence A050781 A060260 A119224` `Adjacent sequences: A053716 A053717 A053718 this_sequence A053720 A053721 A053722`
	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 September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research