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!)
A261051 Expansion of Product_{k>=1} (1+x^k)^(Lucas(k)). 4
1, 1, 3, 7, 14, 33, 69, 148, 307, 642, 1314, 2684, 5432, 10924, 21841, 43431, 85913, 169170, 331675, 647601, 1259737, 2441706, 4716874, 9083215, 17439308, 33387589, 63749174, 121409236, 230658963, 437198116, 826838637, 1560410267, 2938808875, 5524005110 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Vaclav Kotesovec, Asymptotics of the Euler transform of Fibonacci numbers, arXiv:1508.01796 [math.CO], Aug 07 2015
FORMULA
a(n) ~ phi^n / (2*sqrt(Pi)*n^(3/4)) * exp(-1 + 1/(2*sqrt(5)) + 2*sqrt(n) + s), where s = Sum_{k>=2} (-1)^(k+1) * (2 + phi^k)/((phi^(2*k) - phi^k - 1)*k) = -0.590290697526802161885355317939144642488927381134222996704542... and phi = A001622 = (1+sqrt(5))/2 is the golden ratio.
G.f.: exp(Sum_{k>=1} (-1)^(k+1)*x^k*(1 + 2*x^k)/(k*(1 - x^k - x^(2*k)))). - Ilya Gutkovskiy, May 30 2018
MAPLE
L:= n-> (<<0|1>, <1|1>>^n. <<2, 1>>)[1, 1]:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
add(binomial(L(i), j)*b(n-i*j, i-1), j=0..n/i)))
end:
a:= n-> b(n$2):
seq(a(n), n=0..50); # Alois P. Heinz, Aug 08 2015
MATHEMATICA
nmax=40; CoefficientList[Series[Product[(1+x^k)^LucasL[k], {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A223136 A354603 A089526 * A231397 A231464 A146920
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Aug 08 2015
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 April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)