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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005832 Product k^(2^(k-1)), k = 1..n.
(Formerly M3724)
1
1, 4, 324, 21233664, 3240000000000000000, 25786061996226338865429872640000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

M. E. Mays, A worst case of the Fibonacci-Sylvester expansion, J. Combin. Math. Combin. Computing, 1 (1987), 141-148.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10

MAPLE

a:= proc(n) a(n):= `if`(n=1, 1, a(n-1)*n^(2^(n-1))) end:

seq(a(n), n=1..7);  # Alois P. Heinz, May 25 2013

MATHEMATICA

Table[Product[k^(2^(k - 1)), {k, 1, n}], {n, 1, 10}] (* Soumadeep Ghosh, Feb 15 2016 *)

PROG

(PARI) a(n) = prod(k=1, n, k^(2^(k-1))) \\ Michel Marcus, May 25 2013

CROSSREFS

Sequence in context: A186163 A159492 A053917 * A195501 A075768 A135442

Adjacent sequences:  A005829 A005830 A005831 * A005833 A005834 A005835

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Jeffrey Shallit

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 November 13 12:45 EST 2019. Contains 329094 sequences. (Running on oeis4.)