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!)
A214093 Largest prime p such that the greatest prime factor of p^2-1 is prime(n). 1
3, 17, 31, 4801, 881, 8191, 388961, 1419263, 4046849, 36171409, 4620799, 617831551, 170918749, 842277599279, 3554663111, 187753824257, 19854354911, 1233008445689, 60292968751, 508070657249, 4421151404801, 259476225058051, 17431549081705001, 45163738135361, 99913980938200001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The terms were computed using Filip Najman's list, see the link.
LINKS
Filip Najman, Home Page (gives all numbers n such that n^2-1 has no prime factor greater than 97)
EXAMPLE
a(6)=8191 because 8190 = 2*3^2*5*7*13, 8192=2^13 and prime(6)=13.
PROG
(PARI)
/* up to term for p=97 */
/* S[] is the list computed by Filip Najman (16223 elements) */
S=[2, 3, 4, ... , 332110803172167361, 19182937474703818751];
lpf(n)={ vecmax(factor(n)[, 1]) } /* largest prime factor */
{ forprime (p=2, 97,
t = 0;
for (n=1, #S, if ( lpf(S[n]^2-1)==p && isprime(S[n]), t=n ); );
print1(S[t], ", ");
); }
CROSSREFS
Cf. A175607 (largest number k such that the greatest prime factor of k^2-1 is prime(n)).
Sequence in context: A343413 A321796 A372797 * A309744 A115355 A146021
KEYWORD
nonn,hard
AUTHOR
Joerg Arndt, Jul 03 2012
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 August 7 06:58 EDT 2024. Contains 375008 sequences. (Running on oeis4.)