This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A166060 4*3^n - 3*2^n. 9

%I

%S 1,6,24,84,276,876,2724,8364,25476,77196,233124,702444,2113476,

%T 6352716,19082724,57297324,171990276,516167436,1548895524,4647473004,

%U 13943991876,41835121356,125511655524,376547549484,1129667814276

%N 4*3^n - 3*2^n.

%C Second binomial transform of A123932 = [1,4,4,4,4,4,4,4,...].

%C a(n) = sum(A082560(n+1,k): k = 1..2^n). - _Reinhard Zumkeller_, May 14 2015

%H Vincenzo Librandi, <a href="/A166060/b166060.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (5,-6).

%F a(0)= 1, a(1)= 6, a(n)= 5*a(n-1)-6*a(n-2) for n>1. G.f.: (1+x)/(1-5x+6x^2).

%F a(n) = A217764(n,6). - Ross La Haye, Mar 27 2013

%t CoefficientList[Series[(1+x)/((1-2x)*(1-3x)), {x, 0, 30}], x] (* _Vincenzo Librandi_, Dec 05 2012 *)

%o (PARI) a(n)=4*3^n-3<<n \\ _Charles R Greathouse IV_, Jan 12 2012

%o (MAGMA) [4*3^n-3*2^n: n in [0..30]]; // _Vincenzo Librandi_, Dec 05 2012

%o a166060 n = a166060_list !! n

%o a166060_list = map fst \$ iterate (\(u, v) -> (3 * (u + v), 2 * v)) (1, 1)

%o -- _Reinhard Zumkeller_, Jun 09 2013

%Y Cf. A082560, A257956.

%K nonn,easy

%O 0,2

%A _Philippe DelĂ©ham_, Oct 05 2009

%E a(19) and a(22) corrected by _Charles R Greathouse IV_, Jan 12 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 05:49 EDT 2019. Contains 328247 sequences. (Running on oeis4.)