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!)
A049850 a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders. 2
0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 2, 0, 2, 1, 1, 4, 3, 3, 3, 1, 5, 3, 3, 4, 4, 5, 10, 8, 5, 6, 6, 8, 5, 12, 7, 11, 9, 7, 9, 14, 8, 13, 7, 11, 14, 11, 5, 16, 14, 9, 14, 12, 8, 14, 7, 8, 17, 15, 11, 14, 13, 15, 12, 11, 13, 19, 19, 22, 16, 19, 16, 10, 15, 15, 14, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,10
LINKS
EXAMPLE
For prime(10)=29, the primes counted are 11 and 17.
CROSSREFS
Sequence in context: A285193 A354947 A213209 * A319954 A050949 A074943
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 February 22 01:55 EST 2024. Contains 370239 sequences. (Running on oeis4.)