|
|
A194769
|
|
Sum of distinct nonzero sixth powers.
|
|
5
|
|
|
1, 64, 65, 729, 730, 793, 794, 4096, 4097, 4160, 4161, 4825, 4826, 4889, 4890, 15625, 15626, 15689, 15690, 16354, 16355, 16418, 16419, 19721, 19722, 19785, 19786, 20450, 20451, 20514, 20515, 46656, 46657, 46720, 46721, 47385, 47386, 47449, 47450, 50752, 50753, 50816
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
11146309947 = A001661(6) is the largest number not in the sequence.
After a(1) = 1, the next term that is in all the analogous sequences for smaller powers is a(86) = 134067 = A364637(6).
If we tightened the sequence requirement so that the sum was of more than one 6th power, we would remove exactly 30 6th powers from the terms: row 6 of A332065 indicates which 6th powers would remain.
(End)
|
|
LINKS
|
|
|
FORMULA
|
For n > 9108736851, a(n) = n + 2037573096.
|
|
PROG
|
(PARI) upto(lim)={
lim\=1;
my(v=List(), P=prod(n=1, lim^(1/6), 1+x^(n^6), 1+O(x^(lim+1))));
for(n=1, lim, if(polcoeff(P, n), listput(v, n)));
Vec(v)
}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|