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”).
_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Dec 11 2003
a(n) = 10 for 6 <= n <= 500 (I haven't checked past 500.) - _David Wasserman (wasserma(AT)spawar.navy.mil), _, Jan 05 2006
a(n) = A090561(n)^(1/n). - _David Wasserman (wasserma(AT)spawar.navy.mil), _, Jan 05 2006
Corrected and extended by _David Wasserman (wasserma(AT)spawar.navy.mil), _, Jan 05 2006
A090561(n)^(1/n).
Least m such that m^n begins with k^(n-1) for some k > 1.
1, 5, 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, 3, 175
0,1,2
a(n) = 10 for 6 <= n <= 500 (I haven't checked past 500.) - David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2006
a(n) = A090561(n)^(1/n). - David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2006
base,more,nonn,new
Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2006