id:A079953 - OEIS Search Results

Search: id:A079953

Displaying 1-1 of 1 results found.

page 1

Smallest prime p such that prime(n) mod 2*p = prime(n).

+0
3

2, 2, 3, 5, 7, 7, 11, 11, 13, 17, 17, 19, 23, 23, 29, 29, 31, 31, 37, 37, 37, 41, 43, 47, 53, 53, 53, 59, 59, 59, 67, 67, 71, 71, 79, 79, 79, 83, 89, 89, 97, 97, 97, 97, 101, 101, 107, 113, 127, 127, 127, 127, 127, 127, 131, 137, 137, 137, 139, 149, 149, 149, 157, 157 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`T(n, A049084(a(n)))=A000040(n), T defined as in A079950.`
	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)=7.`
	CROSSREFS	`Cf. A079952.` `Sequence in context: A139074 A035428 A100142 this_sequence A133393 A126881 A125505` `Adjacent sequences: A079950 A079951 A079952 this_sequence A079954 A079955 A079956`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 19 2003`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research