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 A104367 #28 Apr 15 2023 14:08:46
%S A104367 2,3,7,13,61,181,97,2521,7561,367,415801,1247401,97103,594311,2689891,
%T A104367 269,415147,1434493,1099944846001,13421,938977307561,1687166397251,
%U A104367 6121943187511,13027211250107,146100174169950001,1389833,10603380543703,2129284819,1156675078903494150001,132597517693,47172675889,11159737,20350106034371
%N A104367 Greatest prime factor of A104365(n) = A104350(n) + 1.
%H A104367 Max Alekseyev, <a href="/A104367/b104367.txt">Table of n, a(n) for n = 1..158</a> (terms 1..76 from Amiram Eldar, terms 142..151 from Tyler Busby)
%H A104367 Reinhard Zumkeller, <a href="/A104350/a104350.txt">Products of largest prime factors of numbers <= n</a>
%F A104367 a(n) = A006530(A104365(n)).
%t A104367 a[n_] := FactorInteger[1 + Product[FactorInteger[k][[-1, 1]], {k, 1, n}]][[-1, 1]]; Array[a, 76] (* _Amiram Eldar_, Feb 12 2020 *)
%Y A104367 Cf. A006530, A002583, A002585, A104350, A104359, A104365, A104366, A104368, A104369, A104370, A104371, A104372.
%K A104367 nonn
%O A104367 1,1
%A A104367 _Reinhard Zumkeller_, Mar 06 2005
%E A104367 Corrected by _T. D. Noe_, Nov 15 2006