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.
%I A247810 #4 Oct 05 2014 19:16:23 %S A247810 0,1,2,3,4,5,6,7,8,9,10,13,15,16,17,18,20,21,23,25,26,27,28,29,30,40, %T A247810 41,42,43,45,46,47,48,49,50,53,56,57,60,63,67,70,73,80,83,85,86,87,90, %U A247810 91,93,95,96,97,98,130,150,153,156,157,160,163,167,170,173 %N A247810 Numbers in decimal representation with distinct digits, such that in Polish their digits are in alphabetic order. %C A247810 List of decimal digits, alphabetically sorted by their names in Polish: %C A247810 4 _ cztery, 2 _ dwa/dwie, 9 _ dziewięć, 1 _ jeden/jedna/jedno, 8 _ osiem, 5 _ pięć, 6 _ sześć, 7 _ siedem, 3 _ trzy, 0 _ zero; %C A247810 finite sequence with last and largest term a(1023) = 4291856730. %H A247810 Reinhard Zumkeller, <a href="/A247810/b247810.txt">Table of n, a(n) for n = 1..1023</a> %o A247810 (Haskell) %o A247810 import Data.IntSet (fromList, deleteFindMin, union) %o A247810 import qualified Data.IntSet as Set (null) %o A247810 a247810 n = a247810_list !! (n-1) %o A247810 a247810_list = 0 : f (fromList [1..9]) where %o A247810 f s | Set.null s = [] %o A247810 | otherwise = x : f (s' `union` %o A247810 fromList (map (+ 10 * x) $ tail $ dropWhile (/= mod x 10) digs)) %o A247810 where (x, s') = deleteFindMin s %o A247810 digs = [4, 2, 9, 1, 8, 5, 6, 7, 3, 0] %Y A247810 Intersection of A010784 and A247760. %Y A247810 Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), A247808 (Latin), A247809 (Norwegian), A247807 (Portuguese), A247811 (Russian), A247812 (Slovak), A247813 (Spanish), A247809 (Swedish), A247814 (Turkish). %K A247810 nonn,base,word,fini,full %O A247810 1,3 %A A247810 _Reinhard Zumkeller_, Oct 05 2014