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!)
A104132 Largest prime factor of pip(n)^pip(n)-1 where pip(n) is the n-th prime-indexed prime. 1
13, 71, 1806113, 2699538733, 568972471024107865287021434301977158534824481, 5926187589691497537793497756719 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A006530(A048861(A006450(n))). - Amiram Eldar, May 23 2020
MATHEMATICA
lpf[n_]:=Module[{p=Prime[Prime[n]]}, FactorInteger[p^p-1][[-1, 1]]]; Array[lpf, 6] (* Harvey P. Dale, Nov 09 2017 *)
PROG
(PARI) piptopipm1(n) = { local(x, y); for(x=1, n, y=pip(x)^pip(x)-1; print1(bdiv(y)", "); ) }
pip(n) = { return(prime(prime(n))) }
bdiv(n) = { local(x); x=ifactor(n); return(x[length(x)]) }
ifactor(n, m=0) = { local(f, j, k, flist); flist=[]; f=Vec(factor(n, m)); for(j=1, length(f[1]), for(k = 1, f[2][j], flist = concat(flist, f[1][j]) ); ); return(flist) }
CROSSREFS
Sequence in context: A332943 A141989 A159512 * A096913 A026916 A106173
KEYWORD
nonn,less
AUTHOR
Cino Hilliard, Mar 06 2005
EXTENSIONS
a(6) corrected by Harvey P. Dale, Nov 09 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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)