This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A329000 #57 Aug 01 2024 14:11:50 %S A329000 1,6,42,60,139810,126,139620524162,2040,349524,419430, %T A329000 2537779500750160131246576896002,16380, %U A329000 44612382091907903486070965589630128805126146,418861572486,146602109610,1048560 %N 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. %C A329000 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. %C A329000 Least k >= 1 such that n divides A329443(k). - _Peter Munn_, Dec 02 2021 %F A329000 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 %e A329000 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. %o A329000 (PARI) \\ See A329339. - _M. F. Hasler_, Nov 14 2019 %Y A329000 Cf. A329126, A329339, A329338, A067029, A268336, A329443. %K A329000 nonn,base %O A329000 1,2 %A A329000 _N. J. A. Sloane_, Nov 12 2019 %E A329000 Definition corrected: not lexicographically earliest string, but smallest binary number. - _M. F. Hasler_, Nov 09 2021 %E A329000 Name aligned with new A329126 name by _Peter Munn_, Dec 02 2021