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.

A247813 Numbers in decimal representation with distinct digits, such that in Spanish their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 21, 23, 26, 27, 28, 29, 31, 41, 42, 43, 46, 47, 48, 49, 51, 52, 53, 54, 56, 57, 58, 59, 61, 63, 67, 71, 73, 81, 83, 86, 87, 91, 93, 96, 97, 98, 231, 261, 263, 267, 271, 273, 281, 283, 286, 287, 291, 293, 296, 297, 298, 421, 423
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Spanish:
0 cero, 5 cinco, 4 cuatro, 2 dos, 9 nueve, 8 ocho, 6 seis, 7 siete, 3 tres, 1 uno/una;
finite sequence with last and largest term a(512) = 542986731.

Crossrefs

Intersection of A010784 and A161390 .
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), A247808 (Latin), A247809 (Norwegian), A247810 (Polish), A247807 (Portuguese), A247811 (Russian), A247812 (Slovak), A247809 (Swedish), A247814 (Turkish).

Programs

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