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.

A185389 Largest number k such that the greatest prime factor of k^2+1 is A002313(n), the n-th prime not congruent to 3 mod 4.

Original entry on oeis.org

1, 7, 239, 268, 307, 18543, 2943, 485298, 330182, 478707, 24208144, 22709274, 2189376182, 284862638, 599832943, 19696179, 314198789, 3558066693, 69971515635443, 18986886768, 18710140581, 104279454193
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.
Numbers k such that k^2+1 is p-smooth appear in arctan-relations for the computation of Pi (for example, Machin's identity Pi/4 = 4*arctan(1/5) - arctan(1/239)), see the fxtbook link. [Joerg Arndt, Jul 02 2012]

Crossrefs

Equivalents for other polynomials: A175607 (k^2 - 1), A145606 (k^2 + k).