cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A175607 Largest number k such that the greatest prime factor of k^2 - 1 is prime(n).

Original entry on oeis.org

3, 17, 161, 8749, 19601, 246401, 672281, 23718421, 10285001, 354365441, 3222617399, 9447152318, 127855050751, 842277599279, 2218993446251, 2907159732049, 41257182408961, 63774701665793, 25640240468751, 238178082107393, 4573663454608289, 19182937474703818751, 34903240221563713, 332110803172167361, 99913980938200001
Offset: 1

Views

Author

Keywords

Comments

For any prime p, there are finitely many k such that k^2-1 has p as its largest prime factor.
For every prime p, is there some k where the greatest prime factor of k^2-1 is p? Answer from Artur Jasinski, Oct 22 2010: Yes.
As mentioned by Luca and Najman, this problem is closely related to the one in A002071.
The terms give an upper bound with a method for the simultaneous computation of logarithms of small primes, see the fxtbook link. - Joerg Arndt, Jul 03 2012

Crossrefs

Cf. A214093 (largest primes p such that the greatest prime factor of p^2-1 is prime(n)).
Cf. A076605 (largest prime divisor of n^2-1).
Cf. A285283 (equivalent for k^2+1). - Tomohiro Yamada, Apr 22 2017
Cf. A006530, A005563. - M. F. Hasler, Jun 13 2018

Programs

  • 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, t=n ) );
      print1(S[t],", ");
    );}
    /* Joerg Arndt, Jul 03 2012 */

Extensions

More terms (using Filip Najman's list) by Joerg Arndt, Jul 03 2012