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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114898 a(1)=0. a(n) = number of earlier terms a(k) (1 <=k <=n-1) where a(k)+n is a prime. 2
0, 1, 1, 2, 2, 2, 1, 0, 3, 4, 5, 4, 4, 2, 7, 5, 6, 5, 5, 1, 4, 5, 3, 6, 6, 7, 8, 6, 7, 7, 6, 5, 5, 6, 11, 16, 13, 9, 9, 11, 12, 13, 7, 4, 6, 11, 10, 12, 8, 7, 8, 12, 12, 15, 17, 14, 12, 11, 15, 16, 15, 14, 11, 13, 16, 21, 22, 18, 12, 11, 16, 17, 14, 12, 12, 12, 20, 17, 10, 8, 14, 14, 16, 13, 21 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

T. D. Noe, Table of n, a(n) for n=1..2000

EXAMPLE

If we add 10 to each of the first 9 terms of the sequence, we get [10,11,11,12,12,12,11,10,13]. Of these only the three 11's and the 13 are primes. So a(10) = 4.

CROSSREFS

Cf. A108839, A114899, A123541

Sequence in context: A176389 A076451 A108839 * A058101 A112159 A132980

Adjacent sequences:  A114895 A114896 A114897 * A114899 A114900 A114901

KEYWORD

nonn

AUTHOR

Leroy Quet Jan 05 2006

EXTENSIONS

Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Apr 30 2007

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 16 17:48 EST 2012. Contains 205939 sequences.