|
| |
|
|
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; internal format)
|
| |
| |
|
|
