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 A095408 #14 Dec 17 2017 03:07:21
%S A095408 -1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,1,0,0,-1,1,-1,0,0,1,0,-1,
%T A095408 1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,0,-1,0,1,1,0,0,1,0,1,1,0,1,0,1,0,-1,1,
%U A095408 2,0,1,1,1,0,0,0,1,0,1,1,2,0,0,-1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,0,0,0,1,-1,0,1,0,0,0,0,0,-1,0,1,0,-1,0,1,0,0,0,0,0,0,-1
%N A095408 Total number of decimal digits in all distinct prime factors of n minus number of digits in n.
%H A095408 Antti Karttunen, <a href="/A095408/b095408.txt">Table of n, a(n) for n = 1..12345</a>
%F A095408 a(n) = A095407(n) - A055642(n).
%e A095408 n=22: prime divisors are {2,11}, a(22) = 3-2 = 1.
%e A095408 n=63: prime divisors are {3,7}, a(63) = 2-2 = 0.
%e A095408 n=100: prime divisors are {2,5}, a(100) = 2-3 = -1.
%t A095408 ffi[x_] :=Flatten[FactorInteger[x]] lf[x_] :=Length[FactorInteger[x]] ba[x_] :=Table[Part[ffi[x], 2*j-1], {j, 1, lf[x]}] tdp[x_] :=Flatten[Table[IntegerDigits[Part[ba[x], j]], {j, 1, lf[x]}], 1] pl[x_] :=Length[tdp[x]] nl[x_] :=Length[IntegerDigits[x]] t1=Table[nl[w], {w, 1, 1000}];t2=Table[pl[w], {w, 1, 1000}];t2-t1
%t A095408 (* Second program: *)
%t A095408 Array[Total@ IntegerLength[FactorInteger[#][[All, 1]]] - IntegerLength@ # - Boole[# == 1] &, 108] (* _Michael De Vlieger_, Dec 16 2017 *)
%o A095408 (PARI)
%o A095408 A095407(n) = vecsum(apply(p->#digits(p), factor(n)[, 1]));
%o A095408 A095408(n) = (A095407(n) - #digits(n)); \\ _Antti Karttunen_, Dec 16 2017
%Y A095408 Cf. A055642, A095407.
%K A095408 base,sign
%O A095408 1,66
%A A095408 _Labos Elemer_, Jun 21 2004