login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046068 Second smallest m such that (2n-1)2^m+1 is prime, or -1 if no such value exists. 4
1, 2, 3, 4, 2, 3, 8, 2, 15, 10, 4, 9, 4, 4, 3, 60, 6, 3, 4, 2, 11, 6, 9, 1483, 6, 3, 5, 8, 3, 11, 12, 4, 3, 6, 2, 5, 6, 3, 7, 10, 4, 5, 6, 6, 7, 168, 4, 3, 4, 2, 9, 18, 2, 7, 14, 4, 5, 12, 4, 3, 12, 8, 5, 12, 5, 3, 6, 2, 27, 14, 3, 77, 16, 11, 7, 20, 2, 7, 12, 7, 5, 4, 2, 103, 14, 9, 13, 4 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Cf. A046067, A046070.

Sequence in context: A049865 A070771 A182985 * A166281 A107468 A023632

Adjacent sequences:  A046065 A046066 A046067 * A046069 A046070 A046071

KEYWORD

sign

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.