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.

A090568 Least m such that m^n begins with k^(n-1) for some k > 1.

Original entry on oeis.org

1, 2, 4, 3, 7, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10
Offset: 1

Views

Author

Amarnath Murthy, Dec 11 2003

Keywords

Comments

a(n) = 10 for 6 <= n <= 500 (I haven't checked past 500.) - David Wasserman, Jan 05 2006

Crossrefs

Cf. A090561.

Formula

a(n) = A090561(n)^(1/n). - David Wasserman, Jan 05 2006

Extensions

Corrected and extended by David Wasserman, Jan 05 2006