OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..90
R. Grünwald, E. Heidel, A. Strätz, M. Sünkel and R. Terbach, Induction on Number Series, Fakultät fur Wirtschaftsinformatik und Angewandte Informatik, Otto-Friedrich-Universität Bamberg, 2012. - N. J. A. Sloane, Feb 07 2013
FORMULA
a(n) = (Product_{k=0..n} L(k))/2 with L = A000032.
Sum_{n>=0} 1/a(n) = 1 + A101690. - Amiram Eldar, Nov 09 2020
a(n) = 2^n*Product_{j=1..n} i^j*cosh(c*j), where c = arccsch(2) - i*Pi/2. - Peter Luschny, Jul 07 2025
MAPLE
c := arccsch(2) - I*Pi/2:
A070825 := n -> local j; 2^n*mul(I^j*cosh(c*j), j = 1..n):
seq(simplify(A070825(n)), n = 0..18); # Peter Luschny, Jul 07 2025
MATHEMATICA
FoldList[Times, LucasL[Range[0, 20]]]/2 (* or *)
Table[Round[GoldenRatio^(n(n+1)/2) QPochhammer[-1, GoldenRatio-2, n+1]]/2, {n, 0, 20}] (* Vladimir Reshetnikov, Sep 15 2016 *)
PROG
(PARI) a(n) = prod(k=0, n, fibonacci(k+1)+fibonacci(k-1))/2; \\ Michel Marcus, Mar 18 2016
(Magma) [1] cat [&*[Lucas(i+1): i in [0..n]]: n in [0..20]]; // Vincenzo Librandi, Sep 15 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, May 10 2002
STATUS
approved
