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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A203074 a(0)=1; for n>0, a(n) = next prime after 2^(n-1). 4
1, 2, 3, 5, 11, 17, 37, 67, 131, 257, 521, 1031, 2053, 4099, 8209, 16411, 32771, 65537, 131101, 262147, 524309, 1048583, 2097169, 4194319, 8388617, 16777259, 33554467, 67108879, 134217757, 268435459, 536870923, 1073741827, 2147483659 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Equals {1} union A014210. Unlike A014210, every positive integer can be written in one or more ways as a sum of terms of this sequence. See A203075, A203076.

LINKS

M. F. Hasler, Table of n, a(n) for n = 0..1300

Wikipedia, Complete sequence.

FORMULA

A203074(n) = 2^(n-1) + A013597(n-1), for n>0. - M. F. Hasler, Mar 15 2012

EXAMPLE

a(5) = 17, since this is the next prime after 2^(5-1) = 2^4 = 16.

MATHEMATICA

nextprime[n_Integer] := (k=n+1; While[!PrimeQ[k], k++]; k); aprime[m_Integer] := (If[m==0, 1, nextprime[2^(m-1)]]); Table[aprime[l], {l, 0, 100}]

PROG

(PARI) a(n)=if(n, nextprime(2^n/2+1), 1) \\ Charles R Greathouse IV

(PARI) A203074(n)=nextprime(2^(n-1)+1)-!n  \\ M. F. Hasler, Mar 15 2012

CROSSREFS

Cf. A013632, A013597, A014210, A203075, A203076.

Sequence in context: A175247 A079370 A014210 * A014556 A062737 A085613

Adjacent sequences:  A203071 A203072 A203073 * A203075 A203076 A203077

KEYWORD

nonn

AUTHOR

Frank M Jackson and N. J. A. Sloane, Dec 28 2011.

STATUS

approved

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

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

Last modified September 18 09:40 EDT 2014. Contains 246899 sequences.