|
%I #29 May 14 2022 19:37:27
%S 2,5,17,37,41,73,137,149,257,277,293,337,521,577,593,641,661,673,677,
%T 1033,1061,1093,1097,1109,1153,1193,1289,1297,1301,1321,1361,2053,
%U 2069,2081,2089,2113,2129,2213,2309,2341,2377,2389,2593,2633,2689,2693,2729,4129,4133,4177,4229,4241,4261,4357,4373,4421,4649,4673,5153,5189
%N Primes whose base-2 expansion has no two consecutive 1's.
%C Also: numbers appearing in both A000040 and A003714. Is it known to be infinite?
%H Alois P. Heinz, <a href="/A247068/b247068.txt">Table of n, a(n) for n = 1..10000</a>
%H Estelle Basor, Brian Conrey, Kent E. Morrison, <a href="https://arxiv.org/abs/1703.00990">Knots and ones</a>, arXiv:1703.00990 [math.GT], 2017. See page 1.
%p M:= 16: # to get all terms < 2^M
%p B1:= {1}:
%p B2:= {}:
%p for n from 2 to M-1 do
%p B3:= map(`+`,B1,2^n);
%p B1:= B1 union B2;
%p B2:= B3;
%p od:
%p select(isprime,{2} union B1 union B2);
%p # if using Maple 11 or earlier, uncomment the next line
%p # sort(convert(%,list)); # _Robert Israel_, Nov 16 2014
%t Select[Prime[Range[700]],SequenceCount[IntegerDigits[#,2],{1,1}]==0&] (* _Harvey P. Dale_, May 14 2022 *)
%o (Sage)
%o def a_list(M): # All terms < 2^M. After Robert Israel.
%o A = [1]; B = [2]; s = 4
%o for n in range(M-2):
%o C = [a + s for a in A]
%o A.extend(B)
%o B = C
%o s <<= 1
%o A.extend(B)
%o return list(filter(is_prime, A))
%o a_list(13) # _Peter Luschny_, Nov 16 2014
%o (PARI) my(t=bitand(n++,2*n));if(t==0,return(n));my(o=#binary(t)-1);((n>>o)+1)<<o
%o n=0;while(n<1e6,if(isprime(n=step(n)), print1(n", "))) \\ _Charles R Greathouse IV_, Nov 16 2014
%Y Cf. A000040, A003714.
%K nonn,base
%O 1,1
%A _Jeffrey Shallit_, Nov 16 2014
|
