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

A053719

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

Terms

    a(0) =55a(1) =70a(2) =147a(3) =226a(4) =237a(5) =275a(6) =351a(7) =409a(8) =434a(9) =610a(10) =714a(11) =717a(12) =869a(13) =934a(14) =1085a(15) =1369a(16) =1490a(17) =1602a(18) =1643a(19) =1954a(20) =2363a(21) =2405a(22) =2534a(23) =3020a(24) =3241a(25) =3450a(26) =4017a(27) =4039a(28) =4060a(29) =4140

External references