login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154110 The largest number that can be written with n characters, using positive integers, exponentiation and the factorial function. 0
9, 387420489 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The sequence is infinite, but cannot be displayed in OEIS format after a(2).

LINKS

Table of n, a(n) for n=1..2.

Daniel J. Velleman, Exponential vs. Factorial, Am. Math. Monthly, Vol. 113, No.8, pp. 689-703, Oct 2006.

FORMULA

For n > 2, Velleman proves that a(n+1) = a(n)!.

EXAMPLE

a(1) = 9, as we are writing in base 10.

a(2) = 9^9 = 387420489, when writing exponentiation with superscripting instead of using the character "^".

CROSSREFS

Sequence in context: A229687 A029983 A225775 * A235400 A028446 A058470

Adjacent sequences:  A154107 A154108 A154109 * A154111 A154112 A154113

KEYWORD

nonn,base,bref

AUTHOR

Jonathan Vos Post, Jan 04 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 07:58 EDT 2021. Contains 346435 sequences. (Running on oeis4.)