login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133376 a(n) = (...((2^3)^4)^...)^n. 0
2, 8, 4096, 1152921504606846976, 2348542582773833227889480596789337027375682548908319870707290971532209025114608443463698998384768703031934976 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

Another kind of exponential factorial.

See cross-references for other possible definitions of exponential factorials.

Some other terms of the sequence can be computed, but they are quite large and it wouldn't be very convenient to display them.

LINKS

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

FORMULA

a(n) = 2^(n!/2) for n >= 2. - Karl W. Heuer, Nov 25 2014

EXAMPLE

a(4) = 4096, as (2^3)^4 = 4096.

MAPLE

expfact:= proc(n::integer) local i, res; res:=2; for i from 3 to n do res:=(res)^i od; res end proc; seq(expfact(n), n=2..7);

CROSSREFS

Cf. A124075, A049384.

Sequence in context: A054874 A174736 A135238 * A179056 A160814 A038582

Adjacent sequences:  A133373 A133374 A133375 * A133377 A133378 A133379

KEYWORD

nonn

AUTHOR

Pierre Karpman (pierre.karpman(AT)laposte.net), Oct 28 2007

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 22 03:23 EDT 2017. Contains 290942 sequences.