id:A039737 - OEIS Search Results

Search: id:A039737

Displaying 1-1 of 1 results found.

page 1

a(n)=number of primes q<p having (p mod q)=3, where p=nth prime.

+0
1

0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2 (list; graph; listen)

	OFFSET	`1,21`
	CROSSREFS	`Sequence in context: A144871 A066799 A037832 this_sequence A144382 A139553 A078379` `Adjacent sequences: A039734 A039735 A039736 this_sequence A039738 A039739 A039740`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research