id:A053720 - OEIS Search Results

Search: id:A053720

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

+0
1

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 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`i values are A054245 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: A056776 A038494 A026043 this_sequence A093764 A082452 A049104` `Adjacent sequences: A053717 A053718 A053719 this_sequence A053721 A053722 A053723`
	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 July 4 18:25 EDT 2008. Contains 140886 sequences.

AT&T Labs Research