id:A117673 - OEIS Search Results

Search: id:A117673

Displaying 1-1 of 1 results found.

page 1

a(n) = the least k such that k*2*prime(n)+1 is prime.

+0
3

1, 1, 1, 2, 1, 2, 3, 5, 1, 1, 5, 2, 1, 2, 3, 1, 6, 3, 2, 4, 2, 2, 1, 1, 2, 3, 3, 3, 5, 1, 2, 1, 3, 2, 4, 3, 5, 2, 7, 1, 1, 3, 1, 2, 9, 2, 5, 6, 12, 6, 1, 1, 3, 1, 3, 3, 4, 3, 2, 1, 3, 1, 2, 3, 3, 13, 3, 5, 3, 5, 7, 1, 3, 2, 6, 6, 12, 3, 4, 2, 1, 5, 1, 2, 5, 1, 4, 15, 3, 6, 3, 4, 2, 1, 2, 3, 1, 16, 5, 9 (list; graph; listen)

	OFFSET	`1,4`
	EXAMPLE	`a(8)=5 because 2prime(8)=38, and 538+1 is prime.`
	MATHEMATICA	`Table[k := 1; While[ ! PrimeQ[2kPrime[n] + 1], k++ ]; k, {n, 1, 120}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 01 2006`
	CROSSREFS	`Cf. A016014, A074884.` `Sequence in context: A076480 A002730 A081664 this_sequence A107946 A054502 A059346` `Adjacent sequences: A117670 A117671 A117672 this_sequence A117674 A117675 A117676`
	KEYWORD	`nonn`
	AUTHOR	`Don Reble (djr(AT)nk.ca), Apr 25 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research