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 A301346 #20 Jun 10 2022 11:09:09 %S A301346 2,2,5,37,577,14401,39877,251501,95629553,131681894401,13168189440001, %T A301346 1593350922240001,2271708245569901,38775788043632640001, %U A301346 2404319663572286441,1272170577304043929,2938007628841577533852349,13980942259426143240713449,1107848353183710355135404972973,20831587158104092560535861261 %N A301346 Largest prime factor of A020549(n) = (n!)^2 + 1. %C A301346 a(n) = A020549(n) for n in A046029. %H A301346 Daniel Suteu, <a href="/A301346/b301346.txt">Table of n, a(n) for n = 0..70</a> %F A301346 a(n) = A006530(A020549(n)). - _Altug Alkan_, Mar 19 2018 %p A301346 a:= n-> max(numtheory[factorset](n!^2+1)): %p A301346 seq(a(n), n=0..20); # _Alois P. Heinz_, Mar 19 2018 %o A301346 (PARI) a(n) = vecmax(factor(n!^2 + 1)[,1]); \\ _Daniel Suteu_, Jun 10 2022 %Y A301346 Cf. A002583, A020549, A046029, A282706. %K A301346 nonn %O A301346 0,1 %A A301346 _Seiichi Manyama_, Mar 19 2018