A090568 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A090568

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

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

LINKS

Table of n, a(n) for n=1..71.

FORMULA

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

CROSSREFS

Cf. A090561.

Sequence in context: A101267 A207633 A177877 * A329877 A223625 A166017