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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049849 a(n)=number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 3 nonzero remainders. 0
0, 0, 0, 0, 1, 1, 1, 1, 4, 2, 2, 3, 1, 3, 6, 7, 5, 5, 4, 8, 5, 5, 10, 9, 6, 4, 5, 7, 8, 9, 6, 8, 8, 6, 8, 7, 5, 8, 9, 10, 13, 7, 10, 9, 8, 9, 8, 7, 7, 11, 11, 14, 13, 14, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,9

LINKS

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

EXAMPLE

Example: for p(9)=23, the primes counted are 5,13,17,19.

CROSSREFS

Sequence in context: A198101 A058634 A037919 * A112349 A231821 A062072

Adjacent sequences:  A049846 A049847 A049848 * A049850 A049851 A049852

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 22 18:06 EST 2019. Contains 319365 sequences. (Running on oeis4.)