A138066 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A138066

Least k > 0 such that (2n-1)^k + 2 is prime, or 0 if no such number exists.

1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 11, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 113, 0, 1, 7, 0, 1, 1, 0, 3, 1, 0, 1, 1, 0, 12, 1, 0, 1, 3, 0, 1, 255, 0, 8, 1, 0, 1, 1, 0, 1, 1, 0, 1, 3, 0, 2, 15, 0, 2, 1, 0, 1, 23, 0, 1, 1, 0, 4, 3, 0, 1, 1, 0, 3, 1, 0, 136, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,12`
	COMMENTS	`a(3n+1) = 0 for n > 0.` `a(84) > 100000. - Ray Chandler, Aug 10 2011`
	LINKS	`Table of n, a(n) for n=1..83.`
	CROSSREFS	`Cf. A084713 (smallest prime of the form (2n-1)^k + 2, or 0 if no such number exists).` `Cf. A138067 (least k > 1 such that (2n-1)^k + 2 is prime, or 0 if no such number exists).` `Cf. A051783 (k such that 3^k + 2 is prime).` `Cf. A087885 (k such that 5^k + 2 is prime).` `Cf. A090649, A109076, A113480, A138048, A138049, A138050, A138051, A087886, A113481.` `Sequence in context: A216726 A323169 A143197 * A173189 A115595 A342123` `Adjacent sequences: A138063 A138064 A138065 * A138067 A138068 A138069`
	KEYWORD	`hard,nonn`
	AUTHOR	`Alexander Adamchuk, Mar 02 2008`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 28 19:31 EST 2022. Contains 359109 sequences. (Running on oeis4.)