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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156828 a(1) = 2. a(n) = the smallest prime >= a(n-1) + 4. 2
2, 7, 11, 17, 23, 29, 37, 41, 47, 53, 59, 67, 71, 79, 83, 89, 97, 101, 107, 113, 127, 131, 137, 149, 157, 163, 167, 173, 179, 191, 197, 211, 223, 227, 233, 239, 251, 257, 263, 269, 277, 281, 293, 307, 311, 317, 331, 337, 347, 353, 359, 367, 373, 379, 383, 389 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Apparently a(n) = A025584(n) for all n>2. Verified for indices n<=100000. [From R. J. Mathar, Mar 01 2010]

LINKS

Table of n, a(n) for n=1..56.

MAPLE

p := 2: for n from 1 to 100 do printf("%d, ", p) ; p := nextprime(p+3) ; od: [From R. J. Mathar, Feb 21 2009]

CROSSREFS

A156829

Sequence in context: A038942 A175283 A124136 * A019385 A075552 A274504

Adjacent sequences:  A156825 A156826 A156827 * A156829 A156830 A156831

KEYWORD

nonn

AUTHOR

Leroy Quet, Feb 16 2009

EXTENSIONS

More terms from R. J. Mathar, Feb 21 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 17 19:35 EST 2017. Contains 294834 sequences.