OFFSET
1,2
COMMENTS
PROG
(PARI) isok(n) = sum(k=0, n, !is_A005153(binomial(n, k))) == n-1;
(Python)
from itertools import count, islice
from math import comb
from sympy import factorint
def A334084_gen(startvalue=1): # generator of terms >= startvalue
for n in count(max(startvalue, 1)):
for k in range(1, n):
c = comb(n, k)
l = (~c & c-1).bit_length()
if l>0:
P = (1<<l+1)-1
for p, e in factorint(c>>l).items():
if p > 1+P:
break
P *= (p**(e+1)-1)//(p-1)
else:
break
else:
yield n
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Michel Marcus, Apr 14 2020
EXTENSIONS
a(11) from Jinyuan Wang, Apr 14 2020
a(12)-a(16) from Chai Wah Wu, Jul 05 2023
STATUS
approved