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.

A247755 Numbers in decimal representation, such that in German their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19, 22, 30, 31, 32, 33, 34, 35, 36, 37, 39, 42, 44, 50, 52, 54, 55, 56, 57, 59, 62, 64, 66, 67, 72, 74, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 94, 96, 97, 99, 100, 102, 104, 106, 107, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in German:
8 acht, 3 drei, 1 eins, 5 fünf, 9 neun, 0 null, 6 sechs, 7 sieben, 4 vier, 2 zwei;
a(142055) = A247805(1008) = 8315906742 is the greatest term not containing any repeated digits.

Crossrefs

Cf. A247805 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247755 n = a247755_list !! (n-1)
    a247755_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 3, 1, 5, 9, 0, 6, 7, 4, 2]