login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004917 Numbers that are the sum of at most 11 positive 11th powers. 2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 2048, 2049, 2050, 2051, 2052, 2053, 2054, 2055, 2056, 2057, 2058, 4096, 4097, 4098, 4099, 4100, 4101, 4102, 4103, 4104, 4105, 6144, 6145, 6146, 6147, 6148, 6149, 6150, 6151, 6152, 8192, 8193, 8194, 8195, 8196, 8197, 8198 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000

MAPLE

b:= proc(n, i, t) option remember; n=0 or i>0 and t>0

      and (b(n, i-1, t) or i^11<=n and b(n-i^11, i, t-1))

    end:

a:= proc(n) option remember; local k;

      for k from 1+ `if`(n=1, -1, a(n-1))

      while not b(k, iroot(k, 11), 11) do od; k

    end:

seq(a(n), n=1..60);  # Alois P. Heinz, Sep 16 2016

MATHEMATICA

b[n_, i_, t_] := b[n, i, t] = n == 0 || i > 0 && t > 0 && (b[n, i - 1, t] || i^11 <= n && b[n - i^11, i, t - 1]);

a[n_] := a[n] = Module[{k}, For[k = 1 + If[n == 1, -1, a[n - 1]], !b[k, k^(1/11) // Floor, 11], k++]; k];

Array[a, 60] (* Jean-Fran├žois Alcover, Dec 03 2020, after Alois P. Heinz *)

CROSSREFS

Cf. A008455 (11th powers).

Column k=11 of A336820.

Sequence in context: A061497 A004895 A004906 * A077741 A132575 A239235

Adjacent sequences:  A004914 A004915 A004916 * A004918 A004919 A004920

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Alois P. Heinz, Sep 16 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 02:40 EST 2021. Contains 341595 sequences. (Running on oeis4.)