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.

A108779 Numbers of the form (10^i)*(11^j), with i, j >= 0.

Original entry on oeis.org

1, 10, 11, 100, 110, 121, 1000, 1100, 1210, 1331, 10000, 11000, 12100, 13310, 14641, 100000, 110000, 121000, 133100, 146410, 161051, 1000000, 1100000, 1210000, 1331000, 1464100, 1610510, 1771561, 10000000, 11000000, 12100000, 13310000
Offset: 1

Views

Author

Douglas Winston (douglas.winston(AT)srupc.com), Jun 26 2005

Keywords

Crossrefs

Programs

  • Haskell
    import Data.Set (singleton, deleteFindMin, insert)
    a108779 n = a108779_list !! (n-1)
    a108779_list = f $ singleton (1,0,0) where
       f s = y : f (insert (10 * y, i + 1, j) $ insert (11 * y, i, j + 1) s')
             where ((y, i, j), s') = deleteFindMin s
    -- Reinhard Zumkeller, May 15 2015
  • Mathematica
    n = 10^7; Flatten[Table[10^i*11^j, {i, 0, Log10[n]}, {j, 0, Log[11, n/10^i]}]] // Sort (* Amiram Eldar, Sep 25 2020 *)

Formula

Sum_{n>=1} 1/a(n) = (10*11)/((10-1)*(11-1)) = 11/9. - Amiram Eldar, Sep 25 2020
a(n) ~ exp(sqrt(2*log(10)*log(11)*n)) / sqrt(110). - Vaclav Kotesovec, Sep 25 2020