login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A359685 Greatest prime dividing 2^n + n. 1
3, 3, 11, 5, 37, 7, 5, 11, 521, 47, 71, 79, 547, 911, 32783, 241, 307, 6899, 24967, 87383, 457, 4799, 270601, 7109, 3728273, 12497, 1201, 100613, 2017, 17318417, 859, 87211, 47491, 8589934609, 195329, 1483453, 320370521, 8191129, 549755813927, 478881371 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A006530(A006127(n)).
MAPLE
a:= n-> max(numtheory[factorset](2^n+n)):
seq(a(n), n=1..40); # Alois P. Heinz, Jan 11 2023
MATHEMATICA
a[n_] := FactorInteger[2^n + n][[-1, 1]]; Array[a, 40] (* Amiram Eldar, Mar 30 2023 *)
PROG
(PARI) a(n) = vecmax(factor(2^n+n)[, 1]); \\ Michel Marcus, Jan 11 2023
(Python)
from sympy import primefactors
def A359685(n): return max(primefactors((1<<n)+n)) # Chai Wah Wu, Jan 11 2023
CROSSREFS
Sequence in context: A036391 A283138 A262528 * A362154 A073106 A309692
KEYWORD
nonn
AUTHOR
Philippe Deléham, Jan 11 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 20:23 EDT 2024. Contains 374234 sequences. (Running on oeis4.)