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 A086131 #12 Mar 23 2017 10:37:56
%S A086131 0,0,0,2,0,5,0,3,3,7,0,2,0,3,2,2,0,7,0,3,5,13,0,11,5,5,3,2,0,31,0,5,7,
%T A086131 19,3,5,0,7,2,17,0,41,0,3,13,5,0,7,7,5,5,7,0,3,2,23,11,31,0,23,0,11,
%U A086131 17,3,3,61,0,3,13,59,0,13,0,13,11,5,3,71,0,11,3,43,0,31,11,5,2,7,0,41,5,3
%N A086131 Largest prime factor of arithmetic derivative of n if it exists, or a(n)=0 for n=1 and n=prime.
%H A086131 Floris P. van Doorn and Jasper Mulder, <a href="/A086131/b086131.txt">Table of n, a(n) for n = 1..20000</a>
%p A086131 with(numtheory):
%p A086131 d:= n-> n*add(i[2]/i[1], i=ifactors(n)[2]):
%p A086131 a:= n-> (f-> `if`(f<2, 0, max(factorset(f)[])))(d(n)):
%p A086131 seq(a(n), n=1..105); # _Alois P. Heinz_, Jun 08 2015
%t A086131 d[n_] := n*Sum[i[[2]]/i[[1]], {i, FactorInteger[n]}];
%t A086131 a[n_] := Function[f, If[f<2, 0, Max[FactorInteger[f][[All, 1]]]]][d[n]];
%t A086131 Table[a[n], {n, 1, 105}] (* _Jean-François Alcover_, Mar 23 2017, after _Alois P. Heinz_ *)
%Y A086131 Cf. A003415.
%K A086131 nonn
%O A086131 1,4
%A A086131 _Labos Elemer_, Jul 23 2003