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!)
A260229 a(n) = floor(e^(n!)). 0
2, 7, 403, 26489122129, 13041808783936322797338790280986488113446079415755132 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The exponential growth in the number of permutations of n elements.

Next term is too big to be included.

LINKS

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

FORMULA

a(n) = A000149(A000142(n)).

a(n) = floor(sqrt(e^A052849(n) - e^A000142(n) + sqrt(e^A052849(n) - e^A000142(n) + sqrt(e^A052849(n) - e^A000142(n) + ...)))).

EXAMPLE

a(1) = floor(e^(1!)) = floor(e) = 2.

MATHEMATICA

Table[Floor[E^n!], {n, 1, 7}]

PROG

(PARI) default(realprecision, 100); vector(5, n, floor(exp(n!))) \\ Michel Marcus, Aug 06 2015

CROSSREFS

Cf. A000149, A000142.

Cf. A050923, A100731.

Sequence in context: A176748 A262088 A110386 * A321134 A027732 A073698

Adjacent sequences:  A260226 A260227 A260228 * A260230 A260231 A260232

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Jul 20 2015

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 February 22 07:03 EST 2020. Contains 332118 sequences. (Running on oeis4.)