id:A046070 - OEIS Search Results

Search: id:A046070

Displaying 1-1 of 1 results found.

page 1

Second smallest m such that (2n-1)2^m-1 is prime, or -1 if no such value exists.

+0
4

3, 1, 4, 5, 3, 26, 7, 2, 4, 3, 2, 6, 9, 2, 16, 5, 3, 6, 2553, 24, 10, 31, 2, 14, 5, 9, 6, 3, 2, 16, 5, 3, 6, 9, 4, 14, 11, 3, 4, 3, 5, 4, 11, 2, 8, 3, 4, 6, 9, 4, 18, 7, 3, 12, 149, 3, 14, 3, 2, 16, 3, 3, 4, 113, 3, 14, 11, 9, 18, 5, 2, 4, 13, 2, 16, 221, 4, 8, 5, 4, 6, 31, 3, 6, 5, 3, 4, 3 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`There exist odd integers 2k-1 such that (2k-1)2^n-1 is always composite.`
	REFERENCES	`Ribenboim, P. The New Book of Prime Number Records. New York: Springer-Verlag, pp. 357-359, 1996.`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Cf. A046068, A046069.` `Sequence in context: A097207 A118469 A069203 this_sequence A068399 A105177 A050057` `Adjacent sequences: A046067 A046068 A046069 this_sequence A046071 A046072 A046073`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research