cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073388 Convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.

This page as a plain text file.
%I A073388 #24 Oct 04 2022 08:38:32
%S A073388 1,4,16,56,188,608,1920,5952,18192,54976,164608,489088,1443776,
%T A073388 4238336,12382208,36022272,104407296,301618176,868765696,2495715328,
%U A073388 7152286720,20452548608,58369409024
%N A073388 Convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
%H A073388 Muniru A Asiru, <a href="/A073388/b073388.txt">Table of n, a(n) for n = 0..500</a>
%H A073388 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,0,-8,-4).
%F A073388 a(n) = Sum_{k=0..n} b(k)*b(n-k), with b(k) = A002605(k).
%F A073388 a(n) = Sum_{k=0..floor(n/2)} binomial(n-k+1, 1)*binomial(n-k, k)*2^(n-k).
%F A073388 a(n) = ((n+1)*U(n+1) + 2*(n+2)*U(n))/6, with U(n) = A002605(n), n >= 0.
%F A073388 G.f.: 1/(1-2*x*(1+x))^2.
%F A073388 a(n) = Sum_{k=0..floor((n+2)/2)} k*binomial(n-k+2, k)2^(n-k+1). - _Paul Barry_, Oct 15 2004
%t A073388 CoefficientList[Series[1/(1-2*x-2*x^2)^2, {x,0,40}], x] (* _G. C. Greubel_, Oct 03 2022 *)
%o A073388 (Sage) taylor( 1/(1-2*x-2*x^2)^2, x, 0, 24).list() # _Zerinvary Lajos_, Jun 03 2009; modified by _G. C. Greubel_, Oct 03 2022
%o A073388 (GAP) List([0..25], n->2^n*Sum([0..Int(n/2)],k->Binomial(n-k+1,1)*Binomial(n-k,k)*(1/2)^k)); # _Muniru A Asiru_, Jun 12 2018
%o A073388 (Magma) R<x>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( 1/(1-2*x-2*x^2)^2 )); // _G. C. Greubel_, Oct 03 2022
%Y A073388 Second (m=1) column of triangle A073387.
%Y A073388 Cf. A002605.
%K A073388 nonn,easy
%O A073388 0,2
%A A073388 _Wolfdieter Lang_, Aug 02 2002