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 A007092 M0532 #40 Nov 18 2019 22:06:08
%S A007092 0,1,2,3,4,5,10,11,12,13,14,15,20,21,22,23,24,25,30,31,32,33,34,35,40,
%T A007092 41,42,43,44,45,50,51,52,53,54,55,100,101,102,103,104,105,110,111,112,
%U A007092 113,114,115,120,121,122,123,124,125,130,131,132,133,134,135,140,141,142,143,144,145
%N A007092 Numbers in base 6.
%C A007092 Nonnegative integers with no decimal digits > 5. - _Karol Bacik_, Sep 25 2012
%D A007092 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007092 Nathaniel Johnston, <a href="/A007092/b007092.txt">Table of n, a(n) for n = 0..10000</a>
%H A007092 Wikipedia, <a href="http://www.wikipedia.org/wiki/Senary">Senary</a>
%H A007092 R. G. Wilson, V, <a href="/A007088/a007088.pdf">Letter to N. J. A. Sloane, Sep. 1992</a>
%H A007092 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A007092 a(0)=0, a(n) = 10*a(n/6) if n==0 (mod 6), and a(n) = a(n-1)+1 otherwise. - _Benoit Cloitre_, Dec 22 2002
%F A007092 a(n) = Sum{d(i)*10^i: i=0,1,...,m}, where Sum{d(i)*6^i: i=1,2,...,m} = n, and d(i) in {0,1,...,5}. - _Karol Bacik_, Sep 25 2012
%p A007092 A007092 := proc(n) local l: if(n=0)then return 0: fi: l:=convert(n,base,6): return op(convert(l,base,10,10^nops(l))): end: seq(A007092(n),n=0..59); # _Nathaniel Johnston_, May 06 2011
%t A007092 Table[ FromDigits[ IntegerDigits[n, 6]], {n, 0, 65}]
%o A007092 (PARI) a(n)=if(n%6,a(n-1)+1,if(n,10*a(n/6),0)) \\ corrected by _Charles R Greathouse IV_, Sep 25 2012
%o A007092 (PARI) a(n)=n=digits(n,6);n[1]=Str(n[1]);eval(concat(n)) \\ _Charles R Greathouse IV_, Sep 25 2012
%o A007092 (PARI) apply( A007092(n)=fromdigits(digits(n, 6)), [0..66]) \\ _M. F. Hasler_, Nov 18 2019
%o A007092 (Haskell)
%o A007092 a007092 0 = 0
%o A007092 a007092 n = 10 * a007092 n' + m where (n', m) = divMod n 6
%o A007092 -- _Reinhard Zumkeller_, Mar 06 2015
%Y A007092 Cf. A000042 (base 1), A007088 (base 2), A007089 (base 3), A007090 (base 4), A007091 (base 5), A007093 (base 7), A007094 (base 8), A007095 (base 9).
%K A007092 nonn,easy,base
%O A007092 0,3
%A A007092 _N. J. A. Sloane_, _Robert G. Wilson v_