OFFSET
1,1
COMMENTS
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
q[n_] := Module[{e = IntegerExponent[n, 2]}, 2^e > Max[Power @@@ FactorInteger[n/2^e]]]; Select[Range[1000], q]
PROG
(PARI) is(n) = {my(e = valuation(n, 2), m = n>>e); if(m == 1, n>1, f = factor(m); 2^e > vecmax(vector(#f~, i, f[i, 1]^f[i, 2]))); }
(Python)
from itertools import count, islice
from sympy import factorint
def A363122_gen(startvalue=2): # generator of terms >= startvalue
return filter(lambda n:n&-n>max((p**e for p, e in factorint(n>>(~n&n-1).bit_length()).items()), default=0), count(max(startvalue, 2)))
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, May 16 2023
STATUS
approved