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!)
A049848 a(n)=number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 2 nonzero remainders. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

EXAMPLE

Example: for p(6)=13, the primes counted are 7 and 11.

CROSSREFS

Sequence in context: A238847 A011030 A005681 * A152026 A060806 A320044

Adjacent sequences:  A049845 A049846 A049847 * A049849 A049850 A049851

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 17 16:11 EST 2019. Contains 319235 sequences. (Running on oeis4.)