login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A247758
Numbers in decimal representation, such that in Latin their digits are in alphabetic order.
18
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 40, 41, 43, 44, 45, 46, 47, 50, 51, 53, 55, 56, 57, 60, 61, 63, 66, 67, 70, 71, 73, 77, 80, 81, 83, 84, 85, 86, 87, 88, 90, 91, 93, 94, 95, 96, 97, 98, 99, 100, 110
OFFSET
1,3
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;
a(131861) = A247808(1023) = 2984567310 is the greatest term not containing any repeating digits.
PROG
(Haskell)
import Data.IntSet (fromList, deleteFindMin, union)
a247758 n = a247758_list !! (n-1)
a247758_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 = [2, 9, 8, 4, 5, 6, 7, 3, 1, 0]
CROSSREFS
Cf. A247808 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).
Sequence in context: A303948 A275413 A273376 * A247757 A247754 A084383
KEYWORD
nonn,base,word
AUTHOR
Reinhard Zumkeller, Oct 05 2014
STATUS
approved