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 A229747 #24 Jun 08 2022 10:16:39
%S A229747 5,13,41,113,109,2113,1613,1321,26317,525313,14449,30269,268501,
%T A229747 279073,536903681,384773,4327489,47392381,231769777,21841,43249589,
%U A229747 1759217765581,29247661,140737471578113,4981857697937,1326700741,1801439824104653,3630105520141
%N A229747 Largest prime factor of 4^(2*n+1)+1.
%C A229747 4^(2*n+1)+1 = 2^(2*(2*n+1))+1 = (2^(2*n+1)-2^(n+1)+1) * (2^(2*n+1)+2^(n+1)+1).
%C A229747 For all n, the smallest prime factor of 4^(2*n+1)+1 is 5.
%C A229747 Therefore, the present sequence also gives the largest prime factor of (4^(2*n+1)+1)/5 = A299960(n), for all n > 0. See A299959 for the smallest prime factor of this. - _M. F. Hasler_, Feb 27 2018
%H A229747 Daniel Suteu, <a href="/A229747/b229747.txt">Table of n, a(n) for n = 0..547</a>
%F A229747 a(n) = A006530(A052539(2n+1)) = A006530(A207262(n+1)), and for n > 1, a(n) = A006530(A299960(n)) = A006530(A052539(2n+1)/5). \\ _M. F. Hasler_, Feb 27 2018
%F A229747 a(n) = max(A229767(n), A229768(n)), for n >= 1. - _Daniel Suteu_, Jun 08 2022
%e A229747 For n=7, 4^(2*n+1)+1 = 1073741825 = 5*5*13*41*61*1321. So a(7)=1321.
%t A229747 Table[FactorInteger[4^(2n+1)+1][[-1,1]],{n,0,30}] (* _Harvey P. Dale_, Mar 10 2018 *)
%o A229747 (PARI) a(n) = {
%o A229747 f=factor(2^(2*n+1)-2^(n+1)+1);
%o A229747 g=factor(2^(2*n+1)+2^(n+1)+1);
%o A229747 max(f[matsize(f)[1],1], g[matsize(g)[1],1])
%o A229747 }
%Y A229747 Cf. A207262. Bisection of A274903.
%Y A229747 Cf. A299960, A299959, A052539.
%K A229747 nonn
%O A229747 0,1
%A A229747 _Colin Barker_, Sep 28 2013