OFFSET
1,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
Estelle Basor, Brian Conrey, Kent E. Morrison, Knots and ones, arXiv:1703.00990 [math.GT], 2017. See page 1.
MAPLE
M:= 16: # to get all terms < 2^M
B1:= {1}:
B2:= {}:
for n from 2 to M-1 do
B3:= map(`+`, B1, 2^n);
B1:= B1 union B2;
B2:= B3;
od:
select(isprime, {2} union B1 union B2);
# if using Maple 11 or earlier, uncomment the next line
# sort(convert(%, list)); # Robert Israel, Nov 16 2014
MATHEMATICA
Select[Prime[Range[700]], SequenceCount[IntegerDigits[#, 2], {1, 1}]==0&] (* Harvey P. Dale, May 14 2022 *)
PROG
(Sage)
def a_list(M): # All terms < 2^M. After Robert Israel.
A = [1]; B = [2]; s = 4
for n in range(M-2):
C = [a + s for a in A]
A.extend(B)
B = C
s <<= 1
A.extend(B)
return list(filter(is_prime, A))
a_list(13) # Peter Luschny, Nov 16 2014
(PARI) my(t=bitand(n++, 2*n)); if(t==0, return(n)); my(o=#binary(t)-1); ((n>>o)+1)<<o
n=0; while(n<1e6, if(isprime(n=step(n)), print1(n", "))) \\ Charles R Greathouse IV, Nov 16 2014
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Jeffrey Shallit, Nov 16 2014
STATUS
approved