|
%I #20 Aug 17 2022 16:11:44
%S 0,1,2,3,4,5,6,7,8,9,10,12,13,16,17,20,30,32,40,41,42,43,46,47,49,50,
%T 51,52,53,54,56,57,59,60,62,63,70,72,73,76,80,81,82,83,84,85,86,87,89,
%U 90,91,92,93,96,97,120,130,132,160,162,163,170,172,173,176
%N Numbers with distinct digits in alphabetical order (in English).
%C Largest term is 8549176320.
%H Reinhard Zumkeller, <a href="/A053433/b053433.txt">Table of n, a(n) for n = 1..1023</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WordSequence.html">Word Sequence.</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 a053433 n = a053433_list !! (n-1)
%o a053433_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 = [8, 5, 4, 9, 1, 7, 6, 3, 2, 0]
%o -- _Reinhard Zumkeller_, Oct 05 2014
%o (Python)
%o from itertools import combinations
%o afull = sorted(int("".join(t)) for d in range(1, 11) for t in combinations("8549176320", d))
%o print(afull[:65]) # _Michael S. Branicky_, Aug 17 2022
%Y Subsequence of A053432.
%Y Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), A247808 (Latin), A247809 (Norwegian), A247810 (Polish), A247807 (Portuguese), A247811 (Russian), A247812 (Slovak), A247813 (Spanish), A247809 (Swedish), A247814 (Turkish).
%K easy,fini,nonn,word,base,full
%O 1,3
%A _G. L. Honaker, Jr._, Jan 10 2000
|
