login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166536 A product of consecutive doubled Fibonacci numbers. 3
1, 3, 6, 16, 40, 105, 273, 715, 1870, 4896, 12816, 33553, 87841, 229971, 602070, 1576240, 4126648, 10803705, 28284465, 74049691, 193864606, 507544128, 1328767776, 3478759201, 9107509825, 23843770275, 62423800998, 163427632720 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f.: (1 - 3*x^2 + x^3)/(1 - 3*x + 3*x^3 - x^4).
a(n) = F(n+1)*F(n+2) + (1 - (-1)^n)/2, where F = A000045.
a(n) = (F(n+2)*(1 + (-1)^n)/2 + F(n)*(1 - (-1)^n)/2)*(F(n+3)*(1 - (-1)^n)/2 + F(n+1)*(1 + (-1)^n)/2).
a(n)*a(n+2) - a(n+1)^2 = (-1)^n*(F(2*n+4) - 1).
a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4). - G. C. Greubel, May 16 2016
a(n) = Sum_{i=0..n+1} F(i+1)*F(i-1), where F(-1) = 1. - Bruno Berselli, Feb 16 2017
MATHEMATICA
LinearRecurrence[{3, 0, -3, 1}, {1, 3, 6, 16}, 30] (* G. C. Greubel, May 16 2016 *)
PROG
(Magma) /* From the sixth formula: */ F:=Fibonacci; [&+[F(i+1)*F(i-1): i in [0..n+1]]: n in [0..30]]; // Bruno Berselli, Feb 15 2017
(PARI) my(x='x+O('x^30)); Vec((1-3*x^2+x^3)/(1-3*x+3*x^3-x^4)) \\ G. C. Greubel, Jan 09 2019
(Sage) ((1-3*x^2+x^3)/(1-3*x+3*x^3-x^4)).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Jan 09 2019
(GAP) a:=[1, 3, 6, 16];; for n in [5..30] do a[n]:=3*a[n-1]-3*a[n-3]+a[n-4]; od; a; # G. C. Greubel, Jan 09 2019
CROSSREFS
Sequence in context: A205770 A301959 A018022 * A128720 A096745 A293949
KEYWORD
nonn,easy
AUTHOR
Paul Barry, Oct 16 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)