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 A094473 #30 Sep 08 2022 08:45:13
%S A094473 5,13,5,97,5,13,5,17,5,13,5,97,5,13,5,3041,5,13,5,41,5,13,5,17,5,13,5,
%T A094473 97,5,13,5,1153,5,13,5,97,5,13,5,17,5,13,5,89,5,13,5,193,5,13,5,97,5,
%U A094473 13,5,17,5,13,5,41,5,13,5,769,5,13,5,97,5,13,5,17,5,13,5
%N A094473 Smallest prime factor of 2^n+3^n.
%C A094473 If n = 4*k+1 or 4*k+3 then 2^n+3^n is divisible by 5.
%C A094473 If n = 4*k+2 then 2^n+3^n is divisible by 13.
%C A094473 Case n = 4*k including especially n = 2^j cannot be discussed with elementary tools and primality of 2^n+3^n remains open.
%C A094473 a(n) = 17 for n == 8 (mod 16). - _Bruno Berselli_, Dec 23 2019
%H A094473 Antti Karttunen, <a href="/A094473/b094473.txt">Table of n, a(n) for n = 1..1023</a>
%F A094473 a(n) = A020639(A007689(n)). - _Antti Karttunen_, Nov 01 2018
%t A094473 mif[x_]:=Part[Flatten[FactorInteger[x]], 1] Table[mif[2^w+3^w], {w, 1, 75}]
%t A094473 FactorInteger[#][[1,1]]&/@Table[2^n+3^n,{n,80}] (* _Harvey P. Dale_, Mar 26 2019 *)
%o A094473 (PARI) a(n)=factor(2^n+3^n)[1,1] \\ _Charles R Greathouse IV_, Apr 29 2015
%o A094473 (PARI) A094473(n) = { my(k=(2^n+3^n)); forprime(p=2,k,if(!(k%p),return(p))); }; \\ _Antti Karttunen_, Nov 01 2018
%o A094473 (GAP) List([1..80],n->Factors(2^n+3^n)[1]); # _Muniru A Asiru_, Nov 01 2018
%o A094473 (Magma) [Min(PrimeFactors(2^n+3^n)): n in[1..100]]; // _Vincenzo Librandi_, Dec 23 2019
%o A094473 (Magma) [PrimeFactors(2^n+3^n)[1]: n in[1..600]]; // _Bruno Berselli_, Dec 23 2019
%Y A094473 Cf. A007689, A020639, A050244, A082101, A094474-A094494.
%K A094473 nonn
%O A094473 1,1
%A A094473 _Labos Elemer_, Jun 02 2004