|
%I #6 Dec 14 2014 14:18:24
%S 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,
%T 46,47,50,51,53,56,57,60,61,63,67,70,71,73,80,81,83,84,85,86,87,90,91,
%U 93,94,95,96,97,98,210,230,231,240,241,243,245,246,247,250
%N Numbers in decimal representation with distinct digits, such that in Latin their digits are in alphabetic order.
%C List of decimal digits, alphabetically sorted by their names in Latin:
%C 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;
%C finite sequence with last and largest term a(1023) = 2984567310.
%H Reinhard Zumkeller, <a href="/A247808/b247808.txt">Table of n, a(n) for n = 1..1023</a>
%H Wikipedia, <a href="http://de.wikipedia.org/wiki/Zahlen_in_unterschiedlichen_Sprachen#0_bis_10">Zahlen in unterschiedlichen Sprachen</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/List_of_numbers_in_various_languages">List of numbers in various languages</a>
%o (Haskell)
%o import Data.IntSet (fromList, deleteFindMin, union)
%o import qualified Data.IntSet as Set (null)
%o a247808 n = a247808_list !! (n-1)
%o a247808_list = 0 : f (fromList [1..9]) where
%o f s | Set.null s = []
%o | otherwise = x : f (s' `union`
%o fromList (map (+ 10 * x) $ tail $ dropWhile (/= mod x 10) digs))
%o where (x, s') = deleteFindMin s
%o digs = [2, 9, 8, 4, 5, 6, 7, 3, 1, 0]
%Y Intersection of A010784 and A247758.
%Y 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).
%K nonn,base,word,fini,full
%O 1,3
%A _Reinhard Zumkeller_, Oct 05 2014
|
