id:A046067 - OEIS Search Results

Search: id:A046067

Displaying 1-1 of 1 results found.

page 1

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

+0
7

0, 1, 1, 2, 1, 1, 2, 1, 3, 6, 1, 1, 2, 2, 1, 8, 1, 1, 2, 1, 1, 2, 2, 583, 2, 1, 1, 4, 2, 5, 4, 1, 1, 2, 1, 3, 2, 1, 3, 2, 1, 1, 4, 2, 1, 8, 2, 1, 2, 1, 3, 16, 1, 3, 6, 1, 1, 2, 3, 1, 8, 6, 1, 2, 3, 1, 4, 1, 3, 2, 1, 53, 6, 8, 3, 4, 1, 1, 8, 6, 3, 2, 1, 7, 2, 8, 1, 2, 2, 1, 4, 1, 3, 6, 1, 1, 2, 4, 15, 2 (list; graph; listen)

	OFFSET	`1,4`
	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	`T. D. Noe, Table of n, a(n) for n=1..1000` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Cf. A046068.` `Bisection of A040076. Cf. A033809` `Adjacent sequences: A046064 A046065 A046066 this_sequence A046068 A046069 A046070` `Sequence in context: A128807 A071628 A033809 this_sequence A132066 A102190 A138650`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified November 7 16:45 EST 2009. Contains 166093 sequences.

AT&T Labs Research