|
|
A005832
|
|
Product k^(2^(k-1)), k = 1..n.
(Formerly M3724)
|
|
1
|
|
|
|
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
|
|
|
MAPLE
|
a:= proc(n) a(n):= `if`(n=1, 1, a(n-1)*n^(2^(n-1))) end:
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|