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 A007094 M0498 #61 Jan 11 2025 02:38:47
%S A007094 0,1,2,3,4,5,6,7,10,11,12,13,14,15,16,17,20,21,22,23,24,25,26,27,30,
%T A007094 31,32,33,34,35,36,37,40,41,42,43,44,45,46,47,50,51,52,53,54,55,56,57,
%U A007094 60,61,62,63,64,65,66,67,70,71,72,73,74,75,76,77,100,101,102,103,104,105,106,107,110,111
%N A007094 Numbers in base 8.
%D A007094 Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, ยง2.8 Binary, Octal, Hexadecimal, p. 64.
%D A007094 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007094 Nathaniel Johnston, <a href="/A007094/b007094.txt">Table of n, a(n) for n = 0..10000</a>
%H A007094 Wikipedia, <a href="http://www.wikipedia.org/wiki/Octal">Octal</a>.
%H A007094 Robert G. Wilson v, <a href="/A007088/a007088.pdf">Letter to N. J. A. Sloane, Sep. 1992</a>
%H A007094 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A007094 a(0) = 0; a(n) = 10*a(n/8) if n == 0 (mod 8); a(n) = a(n-1) + 1 otherwise. - _Benoit Cloitre_, Dec 22 2002
%F A007094 G.f.: sum(d>=0, 10^d*(x^(8^d) +2*x^(2*8^d) +3*x^(3*8^d) +4*x^(4*8^d) +5*x^(5*8^d) +6*x^(6*8^d) +7*x^(7*8^d)) * (1-x^(8^d)) / ((1-x^(8^(d+1)))*(1-x))). - _Robert Israel_, Aug 03 2014
%p A007094 A007094 := proc(n) local l: if(n=0)then return 0: fi: l:=convert(n,base,8): return op(convert(l,base,10,10^nops(l))): end: seq(A007094(n), n=0..66); # _Nathaniel Johnston_, May 06 2011
%t A007094 Table[FromDigits[IntegerDigits[n, 8]], {n, 0, 70}]
%o A007094 (PARI) a(n)=if(n<1,0,if(n%8,a(n-1)+1,10*a(n/8)))
%o A007094 (PARI) apply( A007094(n)=fromdigits(digits(n,8)), [0..77]) \\ _M. F. Hasler_, Nov 18 2019
%o A007094 (Haskell)
%o A007094 a007094 0 = 0
%o A007094 a007094 n = 10 * a007094 n' + m where (n', m) = divMod n 8
%o A007094 -- _Reinhard Zumkeller_, Aug 29 2013
%o A007094 (Python)
%o A007094 def a(n): return int(oct(n)[2:])
%o A007094 print([a(n) for n in range(74)]) # _Michael S. Branicky_, Jun 28 2021
%Y A007094 Cf. A057104; A000042 (base 1), A007088 (base 2), A007089 (base 3), A007090 (base 4), A007091 (base 5), A007092 (base 6), A007093 (base 7), A007095 (base 9).
%K A007094 nonn,easy,base
%O A007094 0,3
%A A007094 _N. J. A. Sloane_, _Robert G. Wilson v_