OFFSET
1,1
COMMENTS
A080942(a(n))=2, the two divisors are n and 1 for odd numbers and 2 for even numbers.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
PROG
(Haskell)
a080943 n = a080943_list !! (n-1)
a080943_list = filter ((== 2) . a080942) [1..]
-- Reinhard Zumkeller, Mar 27 2014
(Python)
from itertools import count, islice
from sympy import divisors
def A080943_gen(startvalue=3): # generator of terms >= startvalue
return filter(lambda n:(m:=n&-n)!=n and all(d==m or d==n or (d^n)&((1<<d.bit_length())-1) for d in divisors(n, generator=True)), count(max(startvalue, 3)))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Feb 25 2003
STATUS
approved