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.

A365326 a(n) is the smallest positive number k such that k^2 - 1 and k^2 + 1 each have exactly n distinct prime divisors.

Original entry on oeis.org

2, 5, 13, 83, 463, 4217, 169333, 2273237, 23239523, 512974197, 5572561567
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Sep 01 2023

Keywords

Crossrefs

Cf. A088075 (with k instead of k^2).

Programs

  • PARI
    isok(k, n) = (omega(k^2-1)==n) && (omega(k^2+1)==n);
    a(n) = my(k=2); while (!isok(k, n), k++); k; \\ Michel Marcus, Sep 03 2023

Formula

a(n) >= max(A219017(n), A180278(n)). - Daniel Suteu, Sep 03 2023

Extensions

a(9)-a(11) from Amiram Eldar, Sep 03 2023