cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A004917 Numbers that are the sum of at most 11 positive 11th powers.

Original entry on oeis.org

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
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A008455 (11th powers).
Column k=11 of A336820.

Programs

  • 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 *)

Extensions

More terms from Alois P. Heinz, Sep 16 2016