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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199045 Smallest multiple of 2^n having in decimal representation exactly n digits <= 2. 1
2, 12, 112, 1120, 10112, 101120, 1002112, 10010112, 100101120, 1001011200, 10002010112, 100012122112, 1000121221120, 10001212211200, 100002002010112, 1000000210010112, 10000002100101120, 100000021001011200, 1000000210010112000, 10000000201221210112 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A050621(n) <= a(n) < A050621(n+1); A054055(a(n)) <= 2.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..32
EXAMPLE
n=3: A050621(3) = 104 = 8 * 13, a(3) = 112 = 8 * 14;
n=4: A050621(4) = 1008 = 16 * 63, a(4) = 1120 = 16 * 70.
PROG
(Haskell)
a199045 n = head $
filter ((<= 2) . a054055) $ map (* 2^n) [a034478 (n-1)..]
CROSSREFS
Sequence in context: A212659 A191895 A047855 * A009232 A349311 A218222
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Nov 02 2011
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 12:36 EDT 2024. Contains 371844 sequences. (Running on oeis4.)