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 A094499 #22 Jul 08 2023 15:18:13
%S A094499 13,97,17,3041,1153,769,257,72222721,4043777,2330249132033,625483777,
%T A094499 286721,14496395542529,2752513,65537,319291393,54498164737
%N A094499 Smallest prime factor of 2^(2^n)+3^(2^n), i.e., exponents are powers of 2.
%C A094499 Factors are of the form k*2^(n+1)+1.
%H A094499 Dario Alejandro Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">Factorization using the Elliptic Curve Method</a>.
%H A094499 Anders Björn and Hans Riesel, <a href="https://doi.org/10.1090/S0025-5718-98-00891-6">Factors of generalized Fermat numbers</a>, Math. Comp. 67 (1998), no. 221, pp. 441-446.
%t A094499 f[n_] := Block[{k = 1, m = 2^(n + 1)}, While[ Mod[ PowerMod[2, 2^n, k*m + 1] + PowerMod[3, 2^n, k*m + 1], k*m + 1] != 0, k++ ]; k*m + 1]; Table[ f[n], {n, 9}] (* _Robert G. Wilson v_, Jun 03 2004 *)
%Y A094499 Cf. A050244, A294132.
%K A094499 nonn
%O A094499 1,1
%A A094499 _Labos Elemer_, Jun 02 2004
%E A094499 Edited and extended by _Robert G. Wilson v_, Jun 03 2004