cp's OEIS Frontend

A253913 Numbers of the form m^k + m, with m >= 0 and k > 1.

%I A253913 #19 Jul 10 2021 04:35:11
%S A253913 0,2,6,10,12,18,20,30,34,42,56,66,68,72,84,90,110,130,132,156,182,210,
%T A253913 222,240,246,258,260,272,306,342,350,380,420,462,506,514,520,552,600,
%U A253913 630,650,702,732,738,756,812,870,930,992,1010,1026,1028,1056,1122,1190,1260,1302
%N A253913 Numbers of the form m^k + m, with m >= 0 and k > 1.
%H A253913 Robert Israel, <a href="/A253913/b253913.txt">Table of n, a(n) for n = 1..10000</a>
%p A253913 N:= 10000: # for terms <= N
%p A253913 S:= 0, 2:
%p A253913 for k from 2 to floor(log[2](N)) do
%p A253913   for m from 2 do
%p A253913     v := m^k+m; if v > N then break fi;
%p A253913     S:= S, v;
%p A253913 od od:
%p A253913 sort(convert({S}, list)): # _Robert Israel_, Apr 28 2019, changed Jul 8 2021
%t A253913 max = 1000; Sort[Flatten[Table[m^k + m, {m, 2, Floor[Sqrt[max]]}, {k, 2, Floor[Log[m, max]]}]]] (* _Alonso del Arte_, Jan 18 2015 *)
%o A253913 (Python)
%o A253913 def aupto(lim):
%o A253913     xkx = set(x**k + x for k in range(2, lim.bit_length()) for x in range(int(lim**(1/k))+2))
%o A253913     return sorted(filter(lambda t: t<=lim, xkx))
%o A253913 print(aupto(1500)) # _Michael S. Branicky_, Jul 08 2021
%Y A253913 Cf. A099225, A253914.
%K A253913 nonn
%O A253913 1,2
%A A253913 _Alex Ratushnyak_, Jan 18 2015
%E A253913 Changed to include 0 and 2 by _Robert Israel_, Jul 08 2021