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 A263475 #23 Oct 25 2015 04:52:21
%S A263475 1,23,161,1050,5971,32658,187197,1057467,5495088,25862850,112452321,
%T A263475 501114082,2867532188,21469965415,164448147485,1116524049413,
%U A263475 6550885669936,33615367021792,154093286995596,651413912544125,2703190211181211,12293485890559055
%N A263475 Total number of positive integers < 10^n with multiplicative digital root value 8.
%C A263475 Partial sums of A263481.
%H A263475 Hiroaki Yamanouchi, <a href="/A263475/b263475.txt">Table of n, a(n) for n = 1..50</a>
%F A263475 A263470(n) + A000027(n) + A263471(n) + A000217(n) + A263472(n) + A263473(n) + A263474(n) + A000217(n) + a(n) + A000292(n) = A002283(n).
%t A263475 lim = 6; t = Select[Range[1, 10^lim - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 8 &]; Count[t, n_ /; n <= 10^#] & /@ Range@ lim (* _Michael De Vlieger_, Oct 21 2015 *)
%o A263475 (PARI) t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
%o A263475 a(n) = sum(i=1, 10^n - 1, if(t(i) == 8, 1, 0)); \\ _Altug Alkan_, Oct 19 2015
%Y A263475 Cf. A031347, A034055, A263481.
%K A263475 nonn,base
%O A263475 1,2
%A A263475 _Martin Renner_, Oct 19 2015
%E A263475 a(9)-a(22) from _Hiroaki Yamanouchi_, Oct 25 2015