id:A049849 - OEIS Search Results

Search: id:A049849

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 3 nonzero remainders.

+0
1

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

	OFFSET	`1,9`
	EXAMPLE	`Example: for p(9)=23, the primes counted are 5,13,17,19.`
	CROSSREFS	`Sequence in context: A129107 A058634 A037919 this_sequence A112349 A062072 A140395` `Adjacent sequences: A049846 A049847 A049848 this_sequence A049850 A049851 A049852`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 5 17:24 EST 2009. Contains 170342 sequences.

AT&T Labs Research