A049850 - OEIS

This site is supported by donations to The OEIS Foundation.

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.

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

	OFFSET	`1,10`
	EXAMPLE	`Example: for p(10)=29, the primes counted are 11 and 17.`
	CROSSREFS	`Sequence in context: A120439 A104624 A193863 * A050949 A074943 A045719` `Adjacent sequences: A049847 A049848 A049849 * A049851 A049852 A049853`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.