|
%I #61 Feb 23 2023 09:13:27
%S 5,65,1025,16385,262145,4194305,67108865,1073741825,17179869185,
%T 274877906945,4398046511105,70368744177665,1125899906842625,
%U 18014398509481985,288230376151711745,4611686018427387905,73786976294838206465,1180591620717411303425,18889465931478580854785,302231454903657293676545
%N a(n) = 2^(4n - 2) + 1.
%C With the exception of the first term, all these numbers are composite, and in fact are all multiples of 5. The other factors can be considerably larger than 5, as is the case with say, 2^158 + 1. These numbers can be factored as (2^(2n - 1) + 2^n + 1)(2^(2n - 1) - 2^n + 1). For example, 2^6 + 1 = 65 = (2^3 + 2^2 + 1)(2^3 - 2^2 + 1) = 13 * 5.
%C This formula was discovered by Leon-Francois-Antoine Aurifeuille in 1873. Wells (2005) remarks that knowledge of this formula would have saved Fortune Landry years of work he spent factoring 2^58 + 1.
%C Aurifeuille actually rediscovered a very special case of the identity 4x^4+1 = (2x^2-2x+1)(2x^2+2x+1), which Euler communicated to Goldbach in 1742. (The Fuss reference is in my book Seminumerical Algorithms, 3rd ed., p. 392; I had cited Aurifeuille in the 1st and 2nd editions.) - _Don Knuth_, Feb 09 2013
%C An Engel expansion of 4 to the base 16 as defined in A181565, with the associated series expansion 4 = 16/5 + 16^2/(5*65) + 16^3/(5*65*1025) + 16^4/(5*65*1025*16385) + .... Cf. A087289 and A199561. - _Peter Bala_, Oct 29 2013
%C Conjecture: Let m = 4n - 2. a(n) equals the sum of the m-th powers of the divisors of m divided by the sum of the m-th powers of the odd divisors of m. - _Ivan N. Ianakiev_, Jan 29 2020
%D David Wells, Prime Numbers: The Most Mysterious Figures in Math. Hoboken, New Jersey: John Wiley & Sons (2005) p. 15
%H Vincenzo Librandi, <a href="/A207262/b207262.txt">Table of n, a(n) for n = 1..200</a>
%H FactorDB, <a href="http://factordb.com/index.php?query=2%5E%284*n-2%29%2B1&use=n&n=1&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=20&format=1">Factorizations of 2^(4*n-2)+1</a>
%H P. H. Fuss, <a href="http://eulerarchive.maa.org/correspondence/fuss/goldbach110-169">Correspondance math. et physique</a>, 1 (1843) p. 145.
%H Primenumbers Yahoo Group, <a href="/A207262/a207262.txt">Aurifeuille and factoring</a>, search results.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AurifeuilleanFactorization.html">Aurifeuillean Factorization</a>.
%H Yahoo Groups, <a href="http://groups.yahoo.com/group/primenumbers/msearch?query=Aurifeuille">Aurifeuille and factoring</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (17,-16).
%F a(n) = 4^(2n - 1) + 1.
%F G.f.: 5*x*(1-4*x)/((1-x)*(1-16*x)). - _Bruno Berselli_, Feb 17 2012
%F a(1) = 5, a(n) = 16*(a(n-1) - 1) + 1. - _Arkadiusz Wesolowski_, Feb 17 2012
%F a(n) = 5*A299960(n-1). - _R. J. Mathar_, Feb 28 2018
%F E.g.f.: exp(x) + (exp(16*x) - 5)/4. - _Stefano Spezia_, Jan 30 2020
%t 2^(4*Range[20] - 2) + 1
%t LinearRecurrence[{17, -16}, {5, 65}, 50] (* _Vincenzo Librandi_, Mar 03 2012 *)
%o (PARI) a(n)=4^(2*n-1)+1 \\ _Charles R Greathouse IV_, Oct 07 2015
%Y Cf. A000051, A052539 (supersets). A016825. A087289, A199561.
%K nonn,easy
%O 1,1
%A _Alonso del Arte_, Feb 16 2012
| 