login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A208149 Primes p(n) such that p(n) <= 2^(p(n+1) - p(n)). 2
2, 3, 7, 13, 23, 31, 47, 53, 61, 89, 113, 139, 181, 199, 211, 241, 283, 293, 317, 337, 409, 421, 467, 509, 523, 547, 577, 619, 631, 661, 691, 709, 773, 787, 797, 811, 829, 839, 863, 887, 919, 953, 997, 1021, 1069, 1129, 1201, 1237, 1259, 1307, 1327, 1381 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

EXAMPLE

2 is here because prime(1)=2^(prime(1+1)-prime(1)) or 2=2^(3-2);

3 is here because prime(2)<2^(prime(2+1)-prime(2)) or 3<2^(5-3).

MATHEMATICA

Select[Prime[Range[300]], # <= 2^(NextPrime[#] - #) &] (* T. D. Noe, Feb 28 2012 *)

PROG

(PARI) v=List(); p=2; forprime(q=3, 1e4, if(p<=2^(q-p), listput(v, p)); p=q); Vec(v) \\ Charles R Greathouse IV, Aug 03 2012

CROSSREFS

Cf. A001223.

Sequence in context: A003509 A133370 A182047 * A144104 A088175 A091440

Adjacent sequences:  A208146 A208147 A208148 * A208150 A208151 A208152

KEYWORD

nonn,changed

AUTHOR

Gerasimov Sergey, Feb 23 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 24 09:26 EDT 2013. Contains 225617 sequences.