cp's OEIS Frontend

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.

%I A053721 #8 Oct 17 2012 08:49:54
%S A053721 42,24,50,126,124,212,136,189,304,439,461,145,375,399,219,742,417,742,
%T A053721 1239,1100,1058,1474,1569,434,1126,2669,3076,580,2650,3170,3531,3921,
%U A053721 3647,4525,3484,963,3317,5596,5559,3503,6969,1205,6083,5323,6962,4088
%N 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.
%C A053721 i values are A053719 and j values are A053720.
%e A053721 Py(55) = 56980 = Py(45) + Py(42); Py(70) = 116795 = Py(69) + Py(24);
%Y A053721 Cf. A000330, A053719, A073720.
%K A053721 easy,nice,nonn
%O A053721 0,1
%A A053721 Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 11 2000
%E A053721 Crossrefs in comments corrected by _Jean-François Alcover_, Oct 17 2012