login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Exponential (or binomial) convolution of A000032 (Lucas) with itself, divided by 2.
4

%I #15 Dec 28 2020 20:33:22

%S 2,2,7,17,57,177,577,1857,6017,19457,62977,203777,659457,2134017,

%T 6905857,22347777,72318977,234029057,757334017,2450784257,7930904577,

%U 25664946177,83053510657,268766806017,869747654657,2814562533377,9108115685377,29474481504257

%N Exponential (or binomial) convolution of A000032 (Lucas) with itself, divided by 2.

%H Michael De Vlieger, <a href="/A203579/b203579.txt">Table of n, a(n) for n = 0..1961</a>

%H Sergio Falcon, <a href="https://doi.org/10.7546/nntdm.2020.26.3.96-106">Half self-convolution of the k-Fibonacci sequence</a>, Notes on Number Theory and Discrete Mathematics (2020) Vol. 26, No. 3, 96-106.

%F a(n) = sum(binomial(n,k)*L(k)*L(n-k),k=0..n)/2, n>=0, with L(n)=A000032(n).

%F E.g.f.: (1/2)*(exp(phi*x)+exp(-(phi-1)*x))^2 =

%F exp(x)*(cosh(sqrt(5)*x)+1), with the golden section phi:=(1+sqrt(5))/2. (See the e.g.f. of A000032).

%F a(n) = 2^(n-1)*L(n) + 1.

%F a(n) = 5*A014335(n) + 2. - _Vladimir Reshetnikov_, Oct 06 2016

%e With A000032 = {2,1,3,4,7,...},

%e 2*a(4) = 1*2*7 + 4*1*4 + 6*3*3 + 4*4*1 + 1*7*2 = 114.

%t Array[Sum[Binomial[#, k] LucasL[k] LucasL[# - k], {k, 0, #}]/2 &, 28, 0] (* _Michael De Vlieger_, Dec 28 2020 *)

%Y Cf. A000032, A014335.

%K nonn,easy

%O 0,1

%A _Wolfdieter Lang_, Jan 14 2012