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 A139081 #9 Nov 18 2014 08:49:11
%S A139081 3,5,7,9,8,10,15,17,14,16,15,17,20,12,21,33,26,28,24,12,18,34,31,33,
%T A139081 38,40,34,36,34,36,63,43,28,24,16,46,56,32,21,49,48,50,54,20,32,70,63,
%U A139081 65,74,42,30,66,80,38,19,27,48,88,64,66,92,40,73,77,24,78,84,40,30
%N A139081 a(n) = (largest prime power dividing n) + (largest prime power dividing (n+1)).
%C A139081 The largest prime-power dividing 12 is 4. The largest prime power dividing 13 is 13. So a(12) = 4+13 = 17.
%H A139081 Harvey P. Dale, <a href="/A139081/b139081.txt">Table of n, a(n) for n = 1..1000</a>
%F A139081 a(n) = A034699(n) + A034699(n+1). [From _Franklin T. Adams-Watters_, Apr 09 2009]
%t A139081 With[{c=Table[Max[#[[1]]^#[[2]]&/@FactorInteger[n]],{n,70}]},Total/@ Partition[ c,2,1]] (* _Harvey P. Dale_, Nov 18 2014 *)
%o A139081 Contribution from _Franklin T. Adams-Watters_, Apr 09 2009: (Start)
%o A139081 (PARI) maxpp(n)=local(m,r,pp);m=factor(n);r=1;for(i=1,matsize(m)[1],pp=m[i,1]^m[i,2];if(pp>r,r=pp));r
%o A139081 vector(80,i,maxpp(i)+maxpp(i+1)) (End)
%Y A139081 Cf. A139082, A139083.
%K A139081 nonn
%O A139081 1,1
%A A139081 _Leroy Quet_, Apr 07 2008
%E A139081 More terms from _Franklin T. Adams-Watters_, Apr 09 2009
%E A139081 Definition clarified by _Harvey P. Dale_, Nov 18 2014