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 A274906 #58 Mar 15 2025 14:08:07
%S A274906 3,5,7,17,31,13,127,257,73,41,683,241,8191,127,331,65537,131071,109,
%T A274906 524287,61681,5419,2113,2796203,673,4051,8191,262657,15790321,3033169,
%U A274906 1321,2147483647,6700417,599479,131071,122921,38737,616318177,525313,22366891
%N A274906 Largest prime factor of 4^n - 1.
%H A274906 Max Alekseyev, <a href="/A274906/b274906.txt">Table of n, a(n) for n = 1..1128</a>
%H A274906 J. Brillhart et al., <a href="http://dx.doi.org/10.1090/conm/022">Factorizations of b^n +- 1</a>, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
%F A274906 a(n) = A006530(A024036(n)). - _Michel Marcus_, Jul 11 2016
%F A274906 a(n) = max(A002587(n),A005420(n)). - _Max Alekseyev_, Apr 25 2022
%e A274906 4^7 - 1 = 16383 = 3*43*127, so a(7) = 127
%t A274906 Table[FactorInteger[4^n - 1][[-1, 1]], {n, 40}]
%o A274906 (Magma) [Maximum(PrimeDivisors(4^n-1)): n in [1..40]];
%Y A274906 Second bisection of A005420. - _Michel Marcus_, Jul 13 2016
%Y A274906 Cf. largest prime factor of k^n-1: A005420 (k=2), A074477 (k=3), this sequence (k=4), A074479 (k=5), A274907 (k=6), A074249 (k=7), A274908 (k=8), A274909 (k=9), A005422 (k=10), A274910 (k=11).
%Y A274906 Cf. A006530, A024036.
%K A274906 nonn
%O A274906 1,1
%A A274906 _Vincenzo Librandi_, Jul 11 2016
%E A274906 Terms to a(100) in b-file from _Vincenzo Librandi_, Jul 13 2016
%E A274906 a(101)-a(603) in b-file from _Amiram Eldar_, Feb 08 2020
%E A274906 a(604)-a(1128) in b-file from _Max Alekseyev_, Jul 25 2023, Mar 15 2025