login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A329000
a(n) is the least positive number which yields a multiple of n when its binary digit string, S(n), is read in any numeric base; a(n) is displayed in base 10.
7
1, 6, 42, 60, 139810, 126, 139620524162, 2040, 349524, 419430, 2537779500750160131246576896002, 16380, 44612382091907903486070965589630128805126146, 418861572486, 146602109610, 1048560
OFFSET
1,2
COMMENTS
If we consider sequence terms to be character strings, a(n) is A329126(n) read in base 2 and converted to base 10. Based on b-file for A329126.
Least k >= 1 such that n divides A329443(k). - Peter Munn, Dec 02 2021
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
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Nov 12 2019
EXTENSIONS
Definition corrected: not lexicographically earliest string, but smallest binary number. - M. F. Hasler, Nov 09 2021
Name aligned with new A329126 name by Peter Munn, Dec 02 2021
STATUS
approved