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.

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.

Terms

    a(0) =42a(1) =24a(2) =50a(3) =126a(4) =124a(5) =212a(6) =136a(7) =189a(8) =304a(9) =439a(10) =461a(11) =145a(12) =375a(13) =399a(14) =219a(15) =742a(16) =417a(17) =742a(18) =1239a(19) =1100a(20) =1058a(21) =1474a(22) =1569a(23) =434a(24) =1126a(25) =2669a(26) =3076a(27) =580a(28) =2650a(29) =3170

External references