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.

A364564 Largest prime factor computed for those odd numbers k for which A156552(k) < k.

Original entry on oeis.org

1, 3, 5, 3, 5, 7, 5, 3, 7, 5, 7, 11, 7, 5, 11, 3, 13, 11, 7, 11, 5, 5, 13, 7, 11, 13, 7, 17, 7, 13, 17, 5, 11, 3, 7, 13, 11, 17, 11, 7, 19, 13, 7, 13, 17, 11, 5, 11, 5, 17, 13, 7, 13, 11, 13, 7, 11, 17, 7, 13, 17, 11, 5, 19, 13, 17, 19, 5, 11, 13, 3, 7, 19, 17, 13, 11, 17, 13, 11, 17, 7, 11, 19, 17, 7, 19, 13, 13
Offset: 1

Views

Author

Antti Karttunen, Jul 28 2023

Keywords

Comments

These primes must stay reasonably small, but how small?
See also the example section of A364551.

Crossrefs

Formula

a(n) = A006530(A364561(n)).