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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049848 a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 2 nonzero remainders. 2
0, 0, 1, 1, 1, 2, 4, 3, 2, 3, 2, 4, 6, 5, 3, 2, 5, 3, 5, 5, 5, 6, 3, 6, 6, 7, 5, 5, 6, 5, 7, 4, 7, 5, 8, 4, 8, 6, 5, 4, 4, 7, 6, 6, 8, 7, 7, 9, 10, 7, 6, 4, 9, 7, 8, 9, 7, 7, 6, 8, 4, 4, 10, 6, 7, 9, 7, 7, 8, 5, 11, 4, 9, 10, 10, 6, 9, 7, 12, 12, 9, 9, 7, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
EXAMPLE
For prime(6)=13, the primes counted are 7 and 11.
CROSSREFS
Sequence in context: A238847 A011030 A005681 * A152026 A345928 A060806
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Aug 07 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 23 13:51 EDT 2024. Contains 371914 sequences. (Running on oeis4.)