The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329000 Let S(n) be the lexicographically smallest string which yields a multiple of n when read in any numeric base; a(n) is the binary number S(n) written in base 10. 7
 1, 6, 42, 60, 139810, 126, 139620524162, 2040, 349524, 419430, 2537779500750160131246576896002, 16380, 44612382091907903486070965589630128805126146, 418861572486, 146602109610, 1048560 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A329126 converted from base 2 to base 10. Based on b-file for A329126. LINKS FORMULA a(n) <= A329339(n) = 2^A051903(n)*(m^n-1)/(m-1) with m = 2^A268336(n), equality except for n = 10, 14, 15, ... - M. F. Hasler, Nov 14 2019 EXAMPLE The strings S(1), S(2), S(3), ... are 1, 110, 101010, 111100, 100010001000100010, 1111110, ... (A329126); converted from binary to decimal these give the current sequence. PROG (PARI) See A329339. - M. F. Hasler, Nov 14 2019 CROSSREFS Cf. A329126, A329339, A329338, A067029, A268336. Sequence in context: A097253 A083938 A292316 * A329339 A176308 A103763 Adjacent sequences:  A328997 A328998 A328999 * A329001 A329002 A329003 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Nov 12 2019 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 June 1 04:57 EDT 2020. Contains 334758 sequences. (Running on oeis4.)