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.

A207666 Least number k = k(m) for m = A207017(n).

Original entry on oeis.org

2, 2, 3, 2, 2, 2, 4, 3, 3, 2, 3, 2, 2, 2, 5, 4, 3, 3, 4, 3, 2, 4, 3, 3, 2, 3, 6, 2, 2, 2, 3, 5, 4, 4, 3, 4, 3, 3, 3, 4, 2, 5, 4, 3, 3, 2, 3, 4, 3, 3, 2, 7, 3, 2, 2, 6, 3, 2, 6, 7
Offset: 1

Views

Author

Vladimir Shevelev, Feb 19 2012

Keywords

Comments

Or a(n) is smallest H-divisor of A207017(n).

Crossrefs

Cf. A207017.