id:A079951 - OEIS Search Results

Search: id:A079951

Displaying 1-1 of 1 results found.

page 1

Number of primes p with prime(n)==1 modulo 2*p.

+0
3

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

	OFFSET	`1,6`
	EXAMPLE	`n=6: prime(6)=13 and 13 mod(22)=1, 13 mod(23)=1, 13 mod(25)=3, 13 mod(27)=13, therefore a(6)=2.`
	CROSSREFS	`Cf. A079950, A079952.` `Sequence in context: A090455 A086288 A104360 this_sequence A095407 A038605 A113121` `Adjacent sequences: A079948 A079949 A079950 this_sequence A079952 A079953 A079954`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 19 2003`

page 1

Search completed in 0.002 seconds

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.

AT&T Labs Research