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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105120 a(1) = 2; k(1) = 0; for n > 1: k(n) = smallest number j >= k(n-1) such that 2*a(n-1) + j is prime; a(n) = 2*a(n-1) + k(n). 2
2, 5, 11, 23, 47, 97, 197, 397, 797, 1597, 3203, 6421, 12889, 25841, 51749, 103567, 207227, 414553, 829211, 1658533, 3317177, 6634469, 13269059, 26538257, 53076679, 106153547, 212307299, 424614829, 849229907, 1698460067, 3396920419 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Numbers k(n) are given in A105121.

LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..3000..

EXAMPLE

a(10) = 1597; k(10) = 3; 2*1597 + j is not prime for 3 <= j < 9, but 2*1597 + 9 = 3203 is prime. Hence k(11) = 9 and a(11) = 3203.

MATHEMATICA

a[1] = {2, 0}; a[n_] := a[n] = Block[{m = 2a[n - 1][[1]], k = a[n - 1][[2]]}, While[ !PrimeQ[m + k], k++ ]; {m + k, k}]; Table[ a[n][[1]], {n, 30}] (* Robert G. Wilson v, Apr 08 2005 *)

PROG

(PARI) print1(a=2, ", "); k=0; for(n=2, 31, j=k; while(!isprime(2*a+j), j++); k=j; print1(a=2*a+k, ", ")) \\ Klaus Brockhaus

CROSSREFS

k(n) is in A105121.

Sequence in context: A266550 A081973 A055496 * A084403 A261201 A055011

Adjacent sequences:  A105117 A105118 A105119 * A105121 A105122 A105123

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto, Apr 08 2005

EXTENSIONS

Edited, corrected and extended by Klaus Brockhaus and Robert G. Wilson v, Apr 08 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 06:00 EST 2019. Contains 329350 sequences. (Running on oeis4.)