login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A122118
Least prime factor of 2^n + 5^n.
2
2, 7, 29, 7, 641, 7, 29, 7, 17, 7, 29, 7, 641, 7, 29, 7, 97, 7, 29, 7, 641, 7, 29, 7, 17, 7, 29, 7, 641, 7, 29, 7, 193, 7, 29, 7, 73, 7, 29, 7, 17, 7, 29, 7, 641, 7, 29, 7, 97, 7, 29, 7, 641, 7, 29, 7, 17, 7, 29, 7, 641, 7, 29, 7, 274568286337, 7, 29, 7, 137, 7, 29, 7, 17, 7, 29, 7, 457
OFFSET
0,1
COMMENTS
a(n_odd)=7, a(n=2+4k,k=0,1,...)=29, a(64)=274568286337 is unusually large.
LINKS
Hans Havermann, Table of n, a(n) for n = 0..1023 (terms 0..319 from Antti Karttunen)
FORMULA
a(n) = A020639(A074600(n)). - Antti Karttunen, Nov 02 2018
MATHEMATICA
Table[FactorInteger[2^n+5^n][[1, 1]], {n, 0, 80}] (* or *) Riffle[Table[ FactorInteger[2^n+5^n][[1, 1]], {n, 0, 80, 2}], 7] (* The second program is faster *) (* Harvey P. Dale, Mar 02 2015 *)
PROG
(PARI) A122118(n) = { my(k=(2^n+5^n)); forprime(p=if(64==n, 274568286337, 2), k, if(!(k%p), return(p))); }; \\ Antti Karttunen, Nov 02 2018
CROSSREFS
Cf. A020639, A074600 (2^n + 5^n), A094475 (primes of form 2^n + 5^n), A122119, A337429.
Cf. also A094473.
Sequence in context: A013181 A191478 A321181 * A337429 A059803 A076043
KEYWORD
nonn
AUTHOR
Zak Seidov, Oct 19 2006
STATUS
approved