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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094096 Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142. 1
 1, 5, 1, 494, 533, 133, 1, 361131, 998130, 318354, 389455, 275577, 42778, 14162, 1, 4436526107, 21759994113, 223006618265, 97254937860, 19669357917 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(2^n - 1) = 1. LINKS EXAMPLE n=5->'101', L(5)=3, L(5)!=6, a(5)=533: (533 mod (1+1*6))*2^0 + (533 mod (1+2*6))*2^1 + (533 mod (1+3*6))*2^2 = (533 mod 7)*1+ (533 mod 13)*2 + (533 mod 19)*4 = 1*1 + 0*2 + 1*4 = 5. CROSSREFS Sequence in context: A294257 A162227 A075266 * A009826 A255855 A255858 Adjacent sequences:  A094093 A094094 A094095 * A094097 A094098 A094099 KEYWORD nonn,more AUTHOR Reinhard Zumkeller, May 05 2004 EXTENSIONS Corrected and extended. Sean A. Irvine, Sep 17 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 16 10:43 EDT 2022. Contains 353700 sequences. (Running on oeis4.)