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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085415 Take prime[n] and continue adding 1, 2, ..., a(n) until one reaches a prime. 3
1, 4, 3, 3, 3, 3, 3, 4, 3, 12, 3, 3, 3, 4, 3, 3, 12, 3, 3, 8, 3, 4, 3, 12, 3, 3, 3, 3, 7, 8, 4, 3, 8, 4, 12, 3, 3, 4, 3, 3, 12, 4, 3, 3, 8, 7, 7, 3, 3, 4, 3, 12, 4, 3, 3, 3, 12, 3, 3, 8, 4, 11, 3, 3, 8, 8, 3, 4, 3, 4, 3, 15, 3, 3, 4, 3, 12, 8, 11, 4, 24, 4, 8, 3, 4, 3, 15, 3, 3, 7, 8, 12, 8, 11, 4, 3, 12, 8 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Resulting primes in A085416. See also A085417, A085418.

FORMULA

Prime[n]+m*(1+m)/2 is a prime for some m>0.

EXAMPLE

a(2)=4 because prime[2]+(1+2+3+4)=3+10=13 is a prime

CROSSREFS

Cf. A085416, A085417, A085418.

Sequence in context: A143487 A031350 A031353 * A187470 A059124 A026858

Adjacent sequences:  A085412 A085413 A085414 * A085416 A085417 A085418

KEYWORD

easy,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Jun 29 2003

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 February 13 19:04 EST 2012. Contains 205535 sequences.