id:A116535 - OEIS Search Results

Search: id:A116535

Displaying 1-1 of 1 results found.

page 1

Smallest odd prime p such that 2^n + p is not prime.

+0
1

3, 7, 5, 7, 5, 3, 5, 5, 3, 3, 3, 3, 5, 3, 3, 5, 5, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)

	OFFSET	`0,1`
	EXAMPLE	`A000079(20) + a(20) = 1048576 + 3 = 1048579 = 7163919.`
	MATHEMATICA	`Table[p := 2; While[PrimeQ[2^n + Prime[p]], p++ ]; Prime[p], {n, 0, 150}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 28 2006`
	CROSSREFS	`Cf. A000079, A000040.` `Sequence in context: A107738 A010624 A019638 this_sequence A122001 A161327 A151685` `Adjacent sequences: A116532 A116533 A116534 this_sequence A116536 A116537 A116538`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 27 2006`
	EXTENSIONS	`More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 28 2006`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research