The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A364413 Odd numbers m such that for every k >= 1, m*2^k + 1 has a divisor in the set {3, 7, 11, 19, 31, 37, 41, 61, 73, 109, 151, 331}. 4
 189035277393779, 212050850472529, 618127765127603, 777947701660121, 1171304921532749, 1358735367828947, 1834310020939021, 2357654372323739, 2638037471052913, 3025664372930897, 3935005074246167, 4688754513654559, 4996748200142999, 5425272498782051, 5455203077891285 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Arkadiusz Wesolowski, Table of n, a(n) for n = 1..34560 FORMULA For n > 34560, a(n) = a(n-34560) + 10014447295554878022. CROSSREFS Cf. A076336, A076335, A180247, A291360, A364412. Sequence in context: A288278 A172566 A214947 * A295354 A086439 A086440 Adjacent sequences: A364410 A364411 A364412 * A364414 A364415 A364416 KEYWORD nonn AUTHOR Arkadiusz Wesolowski, Jul 23 2023 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 04:38 EST 2023. Contains 367699 sequences. (Running on oeis4.)