cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A247750 #9 Oct 18 2014 07:26:48
%S A247750 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,
%T A247750 40,41,42,43,44,45,46,47,48,49,53,55,56,57,63,66,73,76,77,83,85,86,87,
%U A247750 88,90,91,92,93,95,96,97,98,99,100,103,105,106,107,108
%N A247750 Numbers in decimal representation, such that in Czech their digits are in alphabetic order.
%C A247750 List of decimal digits, alphabetically sorted by their names in Czech:
%C A247750 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;
%C A247750 a(144740) = A247800(992) = 4921085763 is the greatest term not containing any repeating digits.
%H A247750 Reinhard Zumkeller, <a href="/A247750/b247750.txt">Table of n, a(n) for n = 1..10000</a>
%o A247750 (Haskell)
%o A247750 import Data.IntSet (fromList, deleteFindMin, union)
%o A247750 a247750 n = a247750_list !! (n-1)
%o A247750 a247750_list = 0 : f (fromList [1..9]) where
%o A247750    f s = x : f (s' `union`
%o A247750          fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
%o A247750      where (x, s') = deleteFindMin s
%o A247750    digs = [4, 9, 2, 1, 0, 8, 5, 7, 6, 3]
%Y A247750 Cf. A247800 (subsequence).
%Y A247750 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).
%K A247750 nonn,base,word
%O A247750 1,3
%A A247750 _Reinhard Zumkeller_, Oct 05 2014