A247808 Numbers in decimal representation with distinct digits, such that in Latin their digits are in alphabetic order.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 40, 41, 43, 45, 46, 47, 50, 51, 53, 56, 57, 60, 61, 63, 67, 70, 71, 73, 80, 81, 83, 84, 85, 86, 87, 90, 91, 93, 94, 95, 96, 97, 98, 210, 230, 231, 240, 241, 243, 245, 246, 247, 250

Offset: 1

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

• nonn
• base
• word
• fini
• full

Comments

List of decimal digits, alphabetically sorted by their names in Latin:

2 duo/duae/duo, 9 novem, 8 octo, 4 quattuor, 5 quinque, 6 sex, 7 septem, 3 tres/tria, 1 unus/una/unum, 0 zipherum;

finite sequence with last and largest term a(1023) = 2984567310.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..1023
• Wikipedia, Zahlen in unterschiedlichen Sprachen
• Wikipedia, List of numbers in various languages

Crossrefs

Intersection of A010784 and A247758.

Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), A247809 (Norwegian), A247810 (Polish), A247807 (Portuguese), A247811 (Russian), A247812 (Slovak), A247813 (Spanish), A247809 (Swedish), A247814 (Turkish).

Programs

Haskell

import Data.IntSet (fromList, deleteFindMin, union)
import qualified Data.IntSet as Set (null)
a247808 n = a247808_list !! (n-1)
a247808_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 = [2, 9, 8, 4, 5, 6, 7, 3, 1, 0]