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.

Showing 1-3 of 3 results.

A080808 a(1) = 4, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).

Original entry on oeis.org

4, 49, 4096, 3748096, 4932784804069376, 44934932784038660743085694310776796224
Offset: 1

Views

Author

Amarnath Murthy, Mar 22 2003

Keywords

Comments

a(7) > 10^49. A simple heuristic argument suggests that a(7) has > .999 probability of having between 88 and 99 digits. - David Wasserman, Dec 28 2007

Crossrefs

Formula

a(n) = A097661(n)^n.

Extensions

More terms from Ray G. Opao, Sep 20 2004

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

Original entry on oeis.org

1, 16, 216, 2085136, 62019685191371643, 82626753081964483505319130781618465733184
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2003

Keywords

Examples

			a(3) = 216 obtained by inserting a 2 in a(2) = 16 to get 6^3.
		

Crossrefs

Extensions

More terms from Robert Gerbicz, Aug 24 2006

A080516 a(1) = 5, a(n) = smallest n-th power obtained by inserting digits anywhere in a(n-1).

Original entry on oeis.org

5, 25, 125, 1500625, 7721159067190625, 15177620126188504995068476821390625
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2003

Keywords

Comments

After the first term, this sequence is the same as A080515. [From Sean A. Irvine, Aug 31 2009]

Crossrefs

Extensions

More terms from Robert Gerbicz, Aug 24 2006
Showing 1-3 of 3 results.