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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049850 a(n)=number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

LINKS

Table of n, a(n) for n=1..54.

EXAMPLE

Example: for p(10)=29, the primes counted are 11 and 17.

CROSSREFS

Sequence in context: A286576 A285193 A213209 * A319954 A050949 A074943

Adjacent sequences:  A049847 A049848 A049849 * A049851 A049852 A049853

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 04:47 EST 2019. Contains 319269 sequences. (Running on oeis4.)