id:A049850 - OEIS Search Results

Search: id:A049850

Displaying 1-1 of 1 results found.

page 1

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
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; listen)

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

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research