This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A016048 Least k such that (2*p_n)*k + 1 | Mersenne(p_n), p_n = n-th prime, n >= 2. 0
 1, 3, 9, 1, 315, 3855, 13797, 1, 4, 34636833, 3, 163, 5, 25, 60, 1525, 18900352534538475, 1445580, 1609, 3, 17, 1, 3477359660913989536233495, 59, 36793758459, 12379533, 758220919762679268184943973309, 3421967, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS M(p_n) = 2^p_n - 1 = (2*p_n)*j + 1 = [(2*p_n)*k_1 + 1] ... [(2*p_n)*k_i + 1], n >= 2 (i.e. odd prime p_n), i >= 1. Then k = Min(k_1, ..., k_i). LINKS Chris K. Caldwell, Modular restrictions on Mersenne divisors FORMULA a(n) = (A016047(n) - 1) / (2*A000040(n)). - Jeppe Stig Nielsen, Jul 18 2014 CROSSREFS Sequence in context: A128724 A128753 A179430 * A256501 A229099 A021259 Adjacent sequences:  A016045 A016046 A016047 * A016049 A016050 A016051 KEYWORD nonn AUTHOR EXTENSIONS Definition edited, comment added by Daniel Forgues, Oct 06 2009 STATUS approved

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

Last modified July 21 21:14 EDT 2019. Contains 325199 sequences. (Running on oeis4.)