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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080515 a(1) = 2, a(n) = smallest n-th power obtained by inserting digits anywhere in a(n-1). 3

%I #4 Dec 05 2013 19:56:00

%S 2,25,125,1500625,7721159067190625,15177620126188504995068476821390625

%N a(1) = 2, a(n) = smallest n-th power obtained by inserting digits anywhere in a(n-1).

%Y Cf. A080514, A080516.

%K base,hard,more,nonn

%O 1,1

%A _Amarnath Murthy_, Mar 20 2003

%E More terms from _Robert Gerbicz_, Aug 24 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)