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.
%I A113070 #16 Sep 08 2022 08:45:23
%S A113070 1,6,21,60,156,384,912,2112,4800,10752,23808,52224,113664,245760,
%T A113070 528384,1130496,2408448,5111808,10813440,22806528,47972352,100663296,
%U A113070 210763776,440401920,918552576,1912602624,3976200192,8254390272,17112760320
%N A113070 Expansion of ((1+x)/(1-2x))^2.
%C A113070 Binomial transform is A014915. In general, ((1+x)/(1-r*x))^2 expands to a(n) = ((r+1)*r^n*((r+1)*n + r - 1) + 0^n)/r^2, which is also a(n) = Sum_{k=0..n} C(n,k)*Sum_{j=0..k} (j+1)*(r+1)^j. This is the self-convolution of the coordination sequence for the infinite tree with valency r.
%H A113070 Vincenzo Librandi, <a href="/A113070/b113070.txt">Table of n, a(n) for n = 0..1000</a>
%H A113070 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4).
%F A113070 G.f.: (1+x)^2/(1-2x)^2;
%F A113070 a(n) = 3*2^n(3n+1)/4 + 0^n/4;
%F A113070 a(n) = Sum_{k=0..n} A003945(k)*A003945(n-k);
%F A113070 a(n) = Sum_{k=0..n} C(n, k)*Sum_{j=0..k} (j+1)*3^j.
%F A113070 a(n) = 4*a(n-1) - 4*a(n-2); a(0)=1, a(1)=6, a(2)=21. - _Harvey P. Dale_, May 20 2011
%t A113070 Join[{1},LinearRecurrence[{4,-4},{6,21},30]] (* or *) CoefficientList[ Series[((1+x)/(1-2x))^2,{x,0,30}],x] (* _Harvey P. Dale_, May 20 2011 *)
%o A113070 (Magma) [3*2^n*(3*n+1)/4+0^n/4: n in [0..30]]; // _Vincenzo Librandi_, May 21 2011
%Y A113070 Cf. A113071.
%K A113070 easy,nonn
%O A113070 0,2
%A A113070 _Paul Barry_, Oct 14 2005