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 A069483 #11 Nov 12 2023 11:46:04 %S A069483 5,2,3,3,3,5,3,7,13,5,17,13,7,5,5,7,5,3,23,3,19,3,43,31,11,17,7,3,37, %T A069483 7,43,67,23,5,5,11,5,11,17,11,5,31,3,13,11,41,31,5,19,11,59,5,41,127, %U A069483 13,19,5,137,31,47,5,7,103,13,7,7,167,19,29,13,89,11,37,47,127,193,131,19 %N A069483 Largest prime factor of prime(n+1)^2 - prime(n)^2. %H A069483 Reinhard Zumkeller, <a href="/A069483/b069483.txt">Table of n, a(n) for n = 1..1000</a> %F A069483 a(n) = A006530(A069482(n)). %e A069483 A069482(12) = A000040(13)^2 - A000040(12)^2 = 41^2 - 37^2 = 1681 - 1369 = 312 = 2*2*2*3*13, therefore a(12) = 13. %t A069483 FactorInteger[#[[2]]-#[[1]]][[-1,1]]&/@Partition[Prime[Range[80]]^2,2,1] (* _Harvey P. Dale_, Jan 17 2016 *) %o A069483 (PARI) a(n) = my(f=factor(prime(n+1)^2 - prime(n)^2)); f[#f~,1]; \\ _Michel Marcus_, Nov 12 2023 %Y A069483 Cf. A006530, A069482, A069485. %K A069483 nonn %O A069483 1,1 %A A069483 _Reinhard Zumkeller_, Mar 29 2002, Aug 05 2007