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.

A194233 Smallest number greater than n with exactly the same digits as n in decimal representation, a(n)=10*n if no such number exists.

Original entry on oeis.org

10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 21, 31, 41, 51, 61, 71, 81, 91, 200, 210, 220, 32, 42, 52, 62, 72, 82, 92, 300, 310, 320, 330, 43, 53, 63, 73, 83, 93, 400, 410, 420, 430, 440, 54, 64, 74, 84, 94, 500, 510, 520, 530, 540, 550, 65, 75, 85, 95
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 19 2011

Keywords

Comments

A004186(a(n)) = A004186(n) or A004186(a(n)) = 10*A004186(n).

Programs

  • Haskell
    import Data.List (find); import Data.Maybe (fromMaybe)
    a194233 n =
       fromMaybe (10*n) $ find (== a004186 n) $ map a004186 [n+1..10*n]