Search: id:A134694
Results 1-1 of 1 results found.

%I A134694
%S A134694 2,5,11,19,37,71,137,269,541,1061,2087,4139,8237,16433,32831,65599,
%T A134694 131143,262217,524369,1048661,2097257,4194409,8388733,16777381,33554639,
%U A134694 67109071,134217943,268435697,536871157,1073742073,2147483929
%N A134694 a(0) = 2; a(n) = least prime p such that p >= a(n-1) + 2^n
%C A134694 Primes separated by at least successive powers of 2.
%e A134694 a(0) = 2 (by definition)
%e A134694 a(1) = 5 because 5 is the least prime >= 4 = 2 + 2^1
%e A134694 a(2) = 11 because 11 is the least prime >= 9 = 5 + 2^2
%e A134694 a(3) = 19 because 19 is the least prime >= 19 = 11 + 2^3
%t A134694 a = {2}; Do[i = a[[ -1]]+2^n; While[ !PrimeQ[i], i++ ]; AppendTo[a, i], 
               {n,1,50}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Jan 28 2008
%Y A134694 Cf. A000040.
%Y A134694 Sequence in context: A084572 A040105 A156768 this_sequence A121606 A166164 
               A097008
%Y A134694 Adjacent sequences: A134691 A134692 A134693 this_sequence A134695 A134696 
               A134697
%K A134694 easy,nonn
%O A134694 0,1
%A A134694 Walter G. Carlini (wgcarlini(AT)charter.net), Jan 27 2008
%E A134694 More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               Jan 28 2008

Search completed in 0.001 seconds