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-5 of 5 results.

A076811 Number of n X n matrices over an alphabet of size 13.

Original entry on oeis.org

1, 13, 28561, 10604499373, 665416609183179841, 7056410014866816666030739693, 12646218552730347184269489080961456410641, 3830224792147131369362629348887201408953937846517364173
Offset: 0

Views

Author

Vincenzo Origlio (vincenzo.origlio(AT)itc.cnr.it), Nov 19 2002

Keywords

Comments

a(n) = k^(n^2) with k = 2, 3, 4, ... counts n X n matrices over an alphabet of size k.

Crossrefs

Programs

Formula

a(n) = 13^(n^2).

A244450 Powers of ten billion.

Original entry on oeis.org

1, 10000000000, 100000000000000000000, 1000000000000000000000000000000, 10000000000000000000000000000000000000000, 100000000000000000000000000000000000000000000000000, 1000000000000000000000000000000000000000000000000000000000000
Offset: 0

Views

Author

Tyler Zahnke, Jun 28 2014

Keywords

Comments

The tenth number in this sequence is a googol, the twentieth is a bigoogol, thirtieth is a trigoogol ... hundredth is a decigoogol (or great googol, as Andre Joyce called it), the ten thousandth is a centigoogol (or great great googol, as Joyce called it), and the hundred thousandth one is a maximusmillion. If x is 10^(10^100) divided by (10^10), the x-th member of this sequence is a googolplex.

Crossrefs

Programs

Formula

a(n) = 10000000000^n.

A076807 Number of n X n matrices over an alphabet of size 12.

Original entry on oeis.org

1, 12, 20736, 5159780352, 184884258895036416, 953962166440690129601298432, 708801874985091845381344307009569161216, 75836984583351248111063210627854719374392938360471552
Offset: 0

Views

Author

Vincenzo Origlio (vincenzo.origlio(AT)itc.cnr.it), Nov 18 2002

Keywords

Crossrefs

Programs

Formula

a(n) = 12^(n^2).

A135428 a(n) = 9^n * 10^(n^2).

Original entry on oeis.org

1, 90, 810000, 729000000000, 65610000000000000000, 590490000000000000000000000000, 531441000000000000000000000000000000000000
Offset: 0

Views

Author

Philippe Deléham, Dec 12 2007

Keywords

Comments

Hankel transform of A132897.

Crossrefs

Programs

Formula

a(n) = 9^n*10^(n^2) = A001019(n)*A076782(n).

A109336 "Que sera, sera" sequence: self-describing sequence where a(n) gives the number of n+1's which will be concatenated to form a(n+1); starting with a(1) = 1.

Original entry on oeis.org

1, 2, 33, 444444444444444444444444444444444
Offset: 1

Views

Author

Alexandre Wajnberg, Aug 23 2005

Keywords

Examples

			a(1) says: there will be one 2 in a(2).
a(2)=2 because a(1) said so; and a(2)=2 says: there will be two 3's in a(3).
a(3)=33 because a(2) said so; and also a(3) says: there will be thirty three 4's in a(4).
Therefore a(4)= 444444444444444444444444444444444 (33 times the digit 4).
And a(5)= 555555555555555...555 (with 444444444444444444444444444444444 5's).
		

Crossrefs

Formula

a(1) = 1. For n > 1, let k = floor(1+log_10(n)); then a(n) = n*(10^(k*a(n-1))-1)/(10^k-1).

Extensions

Formula corrected to handle n>9 also by Rick L. Shepherd, Mar 22 2009
Showing 1-5 of 5 results.