login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004913 Numbers that are the sum of at most 7 positive 11th powers. 1

%I #16 Nov 06 2017 23:32:33

%S 0,1,2,3,4,5,6,7,2048,2049,2050,2051,2052,2053,2054,4096,4097,4098,

%T 4099,4100,4101,6144,6145,6146,6147,6148,8192,8193,8194,8195,10240,

%U 10241,10242,12288,12289,14336,177147,177148,177149,177150,177151,177152

%N Numbers that are the sum of at most 7 positive 11th powers.

%H Charles R Greathouse IV, <a href="/A004913/b004913.txt">Table of n, a(n) for n = 1..10000</a>

%H Jan Snellman and Michael Paulsen, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL7/Snellman/snellman2.html">Enumeration of Concave Integer Partitions</a>, J. Integer Seqs., Vol. 7, 2004.

%o (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

%K nonn

%O 1,3

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 09:24 EDT 2024. Contains 375965 sequences. (Running on oeis4.)