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 A057436 #33 Aug 03 2025 03:47:57
%S A057436 1,2,3,4,5,6,11,12,13,14,15,16,21,22,23,24,25,26,31,32,33,34,35,36,41,
%T A057436 42,43,44,45,46,51,52,53,54,55,56,61,62,63,64,65,66,111,112,113,114,
%U A057436 115,116,121,122,123,124,125,126,131,132,133,134,135,136,141,142,143
%N A057436 Contains digits 1 through 6 only.
%C A057436 Numbers whose digits can be generated by successively throwing a regular die with the numbers 1..6 and concatenating the results.
%H A057436 Reinhard Zumkeller, <a href="/A057436/b057436.txt">Table of n, a(n) for n = 1..10000</a>
%H A057436 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A057436 a(n+1) = 1 + (if a(n) mod 10 < 6 then a(n) else a(a(n)\10)*10), a(0)=1. - _Reinhard Zumkeller_, Jul 13 2007
%e A057436 The number 61 can be generated by throwing a die twice and combining the results, but 17 not.
%t A057436 Select[Range[200],Max[IntegerDigits[#]]<=6&& DigitCount[#,10,0] ==0&] (* _Harvey P. Dale_, Apr 04 2011 *)
%t A057436 FromDigits/@Flatten[Table[Tuples[Range[6],n],{n,3}],1] (* _Harvey P. Dale_, Jul 26 2015 *)
%o A057436 (Haskell)
%o A057436 import Data.List (intersect)
%o A057436 a057436 n = a057436_list !! (n-1)
%o A057436 a057436_list = filter (null . (intersect "0789") . show) [1..]
%o A057436 -- _Reinhard Zumkeller_, Mar 28 2012
%o A057436 (Python)
%o A057436 from itertools import product
%o A057436 A057436_list = [int(''.join(d)) for l in range(1,5) for d in product('123456',repeat=l)] # _Chai Wah Wu_, Sep 01 2021
%Y A057436 Cf. A007092, A214676.
%K A057436 easy,nice,nonn,base
%O A057436 1,2
%A A057436 Thomas Schulze (jazariel(AT)tiscalenet.it), Sep 08 2000
%E A057436 Offset corrected by _Reinhard Zumkeller_, Aug 16 2011