cp's OEIS Frontend

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

%I A004917 #19 Dec 03 2020 07:35:30
%S A004917 0,1,2,3,4,5,6,7,8,9,10,11,2048,2049,2050,2051,2052,2053,2054,2055,
%T A004917 2056,2057,2058,4096,4097,4098,4099,4100,4101,4102,4103,4104,4105,
%U A004917 6144,6145,6146,6147,6148,6149,6150,6151,6152,8192,8193,8194,8195,8196,8197,8198
%N A004917 Numbers that are the sum of at most 11 positive 11th powers.
%H A004917 Alois P. Heinz, <a href="/A004917/b004917.txt">Table of n, a(n) for n = 1..10000</a>
%p A004917 b:= proc(n, i, t) option remember; n=0 or i>0 and t>0
%p A004917       and (b(n, i-1, t) or i^11<=n and b(n-i^11, i, t-1))
%p A004917     end:
%p A004917 a:= proc(n) option remember; local k;
%p A004917       for k from 1+ `if`(n=1, -1, a(n-1))
%p A004917       while not b(k, iroot(k, 11), 11) do od; k
%p A004917     end:
%p A004917 seq(a(n), n=1..60);  # _Alois P. Heinz_, Sep 16 2016
%t A004917 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]);
%t A004917 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];
%t A004917 Array[a, 60] (* _Jean-François Alcover_, Dec 03 2020, after _Alois P. Heinz_ *)
%Y A004917 Cf. A008455 (11th powers).
%Y A004917 Column k=11 of A336820.
%K A004917 nonn
%O A004917 1,3
%A A004917 _N. J. A. Sloane_
%E A004917 More terms from _Alois P. Heinz_, Sep 16 2016