A247750 Numbers in decimal representation, such that in Czech their digits are in alphabetic order.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 20, 21, 22, 23, 25, 26, 27, 28, 33, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 53, 55, 56, 57, 63, 66, 73, 76, 77, 83, 85, 86, 87, 88, 90, 91, 92, 93, 95, 96, 97, 98, 99, 100, 103, 105, 106, 107, 108

Offset: 1

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

• nonn
• base
• word

Comments

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

4 čtyři, 9 devět, 2 dva/dvě, 1 jeden/jedna/jedno, 0 nula, 8 osm, 5 pět, 7 sedm, 6 šest, 3 tři;

a(144740) = A247800(992) = 4921085763 is the greatest term not containing any repeating digits.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A247800 (subsequence).

Cf. A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), 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)
a247750 n = a247750_list !! (n-1)
a247750_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 = [4, 9, 2, 1, 0, 8, 5, 7, 6, 3]