cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A199045 Smallest multiple of 2^n having in decimal representation exactly n digits <= 2.

Original entry on oeis.org

2, 12, 112, 1120, 10112, 101120, 1002112, 10010112, 100101120, 1001011200, 10002010112, 100012122112, 1000121221120, 10001212211200, 100002002010112, 1000000210010112, 10000002100101120, 100000021001011200, 1000000210010112000, 10000000201221210112
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 02 2011

Keywords

Comments

A050621(n) <= a(n) < A050621(n+1); A054055(a(n)) <= 2.

Examples

			n=3: A050621(3) = 104 = 8 * 13, a(3) = 112 = 8 * 14;
n=4: A050621(4) = 1008 = 16 * 63, a(4) = 1120 = 16 * 70.
		

Crossrefs

Programs

  • Haskell
    a199045 n = head $
       filter ((<= 2) . a054055) $ map (* 2^n) [a034478 (n-1)..]
Showing 1-1 of 1 results.