id:A049848 - OEIS Search Results

Search: id:A049848

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

+0
1

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

	OFFSET	`1,6`
	EXAMPLE	`Example: for p(6)=13, the primes counted are 7 and 11.`
	CROSSREFS	`Adjacent sequences: A049845 A049846 A049847 this_sequence A049849 A049850 A049851` `Sequence in context: A105972 A011030 A005681 this_sequence A060806 A128868 A095986`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research