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 A367020 #19 Oct 29 2024 03:44:39 %S A367020 2,3,7,43,139,3263443,31051,6212157481,77366930214021991992277, %T A367020 35874380272246624152764569191134894955972560447869169859142453622851 %N A367020 Largest prime factor of A000058(n) = A007018(n) + 1 (Sylvester's sequence). %H A367020 Amiram Eldar, <a href="/A367020/b367020.txt">Table of n, a(n) for n = 0..10</a> %H A367020 Filip Saidak, <a href="http://dx.doi.org/10.2307/27642094">A new proof of Euclid's theorem</a>, Amer. Math. Monthly, 113:10 (2006) 937-938. %H A367020 Wikipedia, <a href="https://en.wikipedia.org/wiki/Sylvester%27s_sequence#Divisibility_and_factorizations">Sylvester's sequence: Divisibility and factorizations</a>. %F A367020 a(n) = A006530(A000058(n)). %Y A367020 Cf. A000058, A007018, A006530, A091335, A323605. %K A367020 nonn %O A367020 0,1 %A A367020 _Sean A. Irvine_, Nov 01 2023