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.

A084858 Binomial transform of A001651.

This page as a plain text file.
%I A084858 #24 Jul 08 2024 21:42:50
%S A084858 1,3,9,24,60,144,336,768,1728,3840,8448,18432,39936,86016,184320,
%T A084858 393216,835584,1769472,3735552,7864320,16515072,34603008,72351744,
%U A084858 150994944,314572800,654311424,1358954496,2818572288,5838471168,12079595520
%N A084858 Binomial transform of A001651.
%C A084858 a(n+1)/3 = A001792(n).
%H A084858 Vincenzo Librandi, <a href="/A084858/b084858.txt">Table of n, a(n) for n = 0..1000</a>
%H A084858 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4).
%F A084858 G.f.: (x^2 - x + 1)/(1-2*x)^2.
%F A084858 a(n) = 3*(0^n/3 + 2^n + n*2^n)/4.
%F A084858 For n > 1: a(n) = 2*a(n-1) + 3*2^(n-2). - _Philippe Deléham_, Nov 10 2011
%F A084858 a(n) = 4*a(n-1) - 4*a(n-2). - _Vincenzo Librandi_, Jun 24 2012
%t A084858 CoefficientList[Series[(x^2-x+1)/(1-2x)^2,{x,0,40}],x] (* _Vincenzo Librandi_, Jun 24 2012 *)
%o A084858 (PARI) a(n)=3*(0^n/3+2^n+n<<n)/4 \\ _Charles R Greathouse IV_, Nov 11 2011
%o A084858 (Magma) I:=[1, 3, 9]; [n le 3 select I[n] else 4*Self(n-1)-4*Self(n-2): n in [1..50]]; // _Vincenzo Librandi_, Jun 24 2012
%K A084858 easy,nonn
%O A084858 0,2
%A A084858 _Paul Barry_, Jun 11 2003