|
| |
|
|
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.
|
|
6
|
|
|
|
42, 24, 50, 126, 124, 212, 136, 189, 304, 439, 461, 145, 375, 399, 219, 742, 417, 742, 1239, 1100, 1058, 1474, 1569, 434, 1126, 2669, 3076, 580, 2650, 3170, 3531, 3921, 3647, 4525, 3484, 963, 3317, 5596, 5559, 3503, 6969, 1205, 6083, 5323, 6962, 4088
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Py(55) = 56980 = Py(45) + Py(42); Py(70) = 116795 = Py(69) + Py(24);
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nice,nonn
|
|
|
AUTHOR
|
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 11 2000
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
