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.

A092846 a(n) = 100...001^n, where there are just enough zeros for the result to display the terms in the n-th row of Pascal's triangle.

Original entry on oeis.org

1, 11, 121, 1331, 14641, 10510100501, 1061520150601, 107213535210701, 10828567056280801, 1009036084126126084036009001, 1010045120210252210120045010001, 1011055165330462462330165055011001, 1012066220495792924792495220066012001
Offset: 0

Views

Author

Jorge Coveiro, Apr 15 2004

Keywords

Examples

			a(0)=11^0
a(1)=11^1
a(2)=11^2
a(3)=11^3
a(4)=11^4
a(5)=101^5
a(6)=101^6
a(7)=101^7
a(8)=101^8
a(9)=1001^9
a(10)=1001^10
a(11)=1001^11
		

Crossrefs

Programs

Formula

a(n) = (10^k + 1)^n, where k is the number of digits in A001405(n). - Eric M. Schmidt, Apr 04 2014