This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206001 Least k such that every term in the sequence k*2^m + 1 is divisible by one of the primes of the n-fold covering set. 0
 271129, 78557, 1777613, 169073869 (list; graph; refs; listen; history; text; internal format)
 OFFSET 6,1 COMMENTS The term "n-fold" refers to a covering set with n primes. For 271129, the covering set is {3, 5, 7, 13, 17, 241}. So we have a covering set with six primes (6-fold). a(10) > 2^31. Other known values: a(11) = 1143502909. [Arkadiusz Wesolowski, Apr 29 2012] LINKS Wikipedia, Covering set Wikipedia, Sierpinski number EXAMPLE 271129 has the covering set {3, 5, 7, 13, 17, 241}. 78557 has the covering set {3, 5, 7, 13, 19, 37, 73}. 1777613 has the covering set {3, 5, 7, 13, 17, 19, 109, 433}. 169073869 has the covering set {3, 5, 7, 11, 13, 41, 61, 151, 331}. CROSSREFS Cf. A076336. Sequence in context: A203940 A139028 A075467 * A137715 A013998 A214193 Adjacent sequences:  A205998 A205999 A206000 * A206002 A206003 A206004 KEYWORD more,nonn AUTHOR Arkadiusz Wesolowski, Feb 10 2012 STATUS approved

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 .