login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A004913
Numbers that are the sum of at most 7 positive 11th powers.
1
0, 1, 2, 3, 4, 5, 6, 7, 2048, 2049, 2050, 2051, 2052, 2053, 2054, 4096, 4097, 4098, 4099, 4100, 4101, 6144, 6145, 6146, 6147, 6148, 8192, 8193, 8194, 8195, 10240, 10241, 10242, 12288, 12289, 14336, 177147, 177148, 177149, 177150, 177151, 177152
OFFSET
1,3
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Jan Snellman and Michael Paulsen, Enumeration of Concave Integer Partitions, J. Integer Seqs., Vol. 7, 2004.
PROG
(PARI) list(lim)=my(v=List(), A, B, C, D, E, F); for(a=0, sqrtnint(lim\=1, 11), A=a^11; for(b=0, min(sqrtnint(lim-A, 11), a), B=A+b^11; for(c=0, min(sqrtnint(lim-B, 11), b), C=B+c^11; for(d=0, min(sqrtnint(lim-C, 11), c), D=C+d^11; for(e=0, min(sqrtnint(lim-D, 11), d), E=D+e^11; for(f=0, min(sqrtnint(lim-E, 11), e), F=E+f^11; for(g=0, min(sqrtnint(lim-F, 11), f), listput(v, F+g^11)))))))); Set(v) \\ Charles R Greathouse IV, Nov 06 2017
CROSSREFS
Sequence in context: A004891 A037442 A004902 * A062945 A032551 A228051
KEYWORD
nonn
STATUS
approved