id:A040081 - OEIS Search Results

Search: id:A040081

Displaying 1-1 of 1 results found.

page 1

Riesel problem: a(n) = smallest m >= 0 such that n*2^m-1 is prime, or -1 if no such prime exists.

+0
9

2, 1, 0, 0, 2, 0, 1, 0, 1, 1, 2, 0, 3, 0, 1, 1, 2, 0, 1, 0, 1, 1, 4, 0, 3, 2, 1, 3, 4, 0, 1, 0, 2, 1, 2, 1, 1, 0, 3, 1, 2, 0, 7, 0, 1, 3, 4, 0, 1, 2, 1, 1, 2, 0, 1, 2, 1, 3, 12, 0, 3, 0, 2, 1, 4, 1, 5, 0, 1, 1, 2, 0, 7, 0, 1, 1, 2, 2, 1, 0, 3, 1, 2, 0, 5, 6, 1, 23, 4, 0, 1, 2, 3, 3, 2, 1, 1, 0, 1, 1, 10, 0, 3 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Cf. A038699 (primes obtained), A050412, A052333.` `Cf. A046069 (for odd n)` `Sequence in context: A054673 A155103 A048105 this_sequence A113063 A123477 A035225` `Adjacent sequences: A040078 A040079 A040080 this_sequence A040082 A040083 A040084`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research