login

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”).

A067457
Smallest n-th power starting with n.
2
1, 25, 343, 4096, 59049, 64, 78125, 815730721, 922190162669056, 1024, 116490258898219, 129746337890625, 13060694016, 147653612273582215982104576, 15407021574586368, 16400152899115243850138976256, 17179869184
OFFSET
1,2
LINKS
MATHEMATICA
Do[k = Floor[ Log[ 10, n] + 1]; While[ FromDigits[ Take[ IntegerDigits [k^n], Floor[ Log[ 10, n] + 1]]] != n, k++ ]; Print[k^n], {n, 1, 20} ]
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Feb 07 2002
EXTENSIONS
Edited and extended by Robert G. Wilson v, Feb 08 2002
STATUS
approved