login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


A109831
Greatest number of primes < prime(n) forming an arithmetic progression such that also prime(n) is a term.
3
1, 1, 2, 2, 1, 2, 2, 3, 4, 2, 1, 3, 3, 2, 4, 3, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 4, 4, 2, 3, 3, 3, 5, 3, 3, 4, 2, 3, 3, 3, 4, 3, 2, 3, 4, 3, 3, 3, 3, 4, 5, 3, 3, 4, 2, 3, 4, 4, 3, 5, 3, 3, 3, 2, 3, 3, 5, 3, 3, 4, 2, 3, 4, 4, 3, 3, 3, 4, 3, 3, 3, 4, 4, 3, 3, 5, 3, 4, 3, 3, 2, 3, 5, 4, 3, 3, 3, 2, 3
OFFSET
2,3
COMMENTS
a(n) = (A000040(n) - A109833(n)) / A109832(n).
CROSSREFS
Sequence in context: A194848 A289497 A029328 * A247352 A097266 A226983
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jul 04 2005
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 20:04 EDT 2024. Contains 376014 sequences. (Running on oeis4.)