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

A053720

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

Terms

    a(0) =45a(1) =69a(2) =145a(3) =212a(4) =225a(5) =224a(6) =344a(7) =395a(8) =377a(9) =522a(10) =643a(11) =715a(12) =845a(13) =909a(14) =1082a(15) =1292a(16) =1479a(17) =1547a(18) =1363a(19) =1830a(20) =2290a(21) =2204a(22) =2315a(23) =3017a(24) =3195a(25) =2804a(26) =3293a(27) =4035a(28) =3642a(29) =3394

External references