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!)
A292238 a(n) = gpf(lpf(2^prime(n) - 1) - 1) where prime(n) is the n-th prime. 1
2, 3, 5, 7, 11, 13, 257, 73, 23, 29, 331, 37, 163, 43, 47, 53, 61, 1321, 2677, 1609, 73, 79, 83, 2931542417, 97, 278557, 599, 28059810762433, 31981, 113, 77158673929, 131, 27977333, 457, 37888318897441, 151, 4523, 461, 541, 173, 179, 181, 191, 587, 197, 3690437 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
For p in A291691, let pp be such that p = prime(pp), then a(pp) = p.
PROG
(PARI) a(n) = vecmax(factor(vecmax(factor(2^prime(n)-1)[, 1])-1)[, 1]);
CROSSREFS
Sequence in context: A029979 A029981 A029982 * A289863 A260904 A245808
KEYWORD
nonn
AUTHOR
Michel Marcus, Sep 12 2017
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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)