|
%I #13 Oct 19 2014 12:42:54
%S 0,1,2,3,4,5,6,7,8,9,11,21,22,23,26,27,28,29,31,33,41,42,43,44,46,47,
%T 48,49,51,52,53,54,55,56,57,58,59,61,63,66,67,71,73,77,81,83,86,87,88,
%U 91,93,96,97,98,99,111,211
%N Numbers with digits in alphabetical order (in Spanish).
%C List of decimal digits, alphabetically sorted by their names in Spanish:
%C 0 _ cero, 5 _ cinco, 4 _ cuatro, 2 _ dos, 9 _ nueve, 8 _ ocho, 6 _ seis, 7 _ siete, 3 _ tres, 1 _ uno/una. - _Reinhard Zumkeller_, Oct 05 2014
%C a(36233) = A247813(512) = 542986731 is the greatest term not containing any repeating digits. - _Reinhard Zumkeller_, Oct 05 2014
%H Reinhard Zumkeller, <a href="/A161390/b161390.txt">Table of n, a(n) for n = 1..10000</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 (Perl) sub isA161390 {
%o shift =~ m/^(0|5*4*2*9*8*6*7*3*1*)$/
%o }
%o (Haskell)
%o import Data.IntSet (fromList, deleteFindMin, union)
%o a161390 n = a161390_list !! (n-1)
%o a161390_list = 0 : f (fromList [1..9]) where
%o f s = x : f (s' `union`
%o fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
%o where (x, s') = deleteFindMin s
%o digs = [0, 5, 4, 2, 9, 8, 6, 7, 3, 1]
%o -- _Reinhard Zumkeller_, Oct 18 2014
%Y Cf. A247813 (subsequence).
%Y Cf. A247750 (Czech), 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), A247759 (Swedish), A247764 (Turkish).
%K nonn,word,base
%O 1,3
%A _Claudio Meller_, Jun 08 2009
|
