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 A263481 #28 Oct 25 2015 07:00:21
%S A263481 1,22,138,889,4921,26687,154539,870270,4437621,20367762,86589471,
%T A263481 388661761,2366418106,18602433227,142978182070,952075901928,
%U A263481 5434361620523,27064481351856,120477919973804,497320625548529,2051776298637086,9590295679377844,54933121828772931
%N A263481 Total number of n-digit positive integers with multiplicative digital root value 8.
%C A263481 First differences of A263475.
%H A263481 Hiroaki Yamanouchi, <a href="/A263481/b263481.txt">Table of n, a(n) for n = 1..50</a>
%F A263481 A263476(n) + A000012(n) + A263477(n) + A000027(n) + A263478(n) + A263479(n) + A263480(n) + A000027(n) + a(n) + A000217(n) = A052268(n).
%t A263481 Last /@ Tally@ IntegerLength@ Select[Range@ 1000000, FixedPoint[Times @@ IntegerDigits@ # &, #] == 8 &] (* _Michael De Vlieger_, Oct 21 2015 *)
%o A263481 (PARI) t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
%o A263481 a(n) = sum(i=10^(n-1), 10^n - 1, if(t(i) == 8, 1, 0)); \\ _Altug Alkan_, Oct 19 2015
%Y A263481 Cf. A031347, A034055, A263475.
%K A263481 nonn,base
%O A263481 1,2
%A A263481 _Martin Renner_, Oct 19 2015
%E A263481 a(9)-a(23) from _Hiroaki Yamanouchi_, Oct 25 2015