The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A172011 12*A002605(n). 0
 0, 12, 24, 72, 192, 528, 1440, 3936, 10752, 29376, 80256, 219264, 599040, 1636608, 4471296, 12215808, 33374208, 91180032, 249108480, 680577024, 1859371008, 5079896064, 13878534144, 37916860416, 103590789120, 283015299072, 773212176384, 2112454950912 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The case k=2 in a family of sequences a(n)=G(k,n), G(k,0)=0, G(k,1)=k*(k+4), G(k,n)=k*G(k,n-1)+k*G(k,n-2). The Binet formula is G(k,n) = (c^n-b^n)*d where d=sqrt(k*(k+4)); c=(k+d)/2; b=(k-d)/2. The generating functions are k*(k+4)*x/(1-k*x-k*x^2). The case k=1 is A022088. LINKS Index entries for linear recurrences with constant coefficients, signature (2,2). FORMULA Binet formula: a(n) = 2*2^n*((-1+3^(1/2))^(-n)-(-1)^n*(1+3^(1/2))^(-n))*3^(1/2) . G.f.: 12*x/(1-2*x-2*x^2). a(n) = 2*a(n-1)+2*a(n-2). CROSSREFS Sequence in context: A001335 A206026 A145899 * A239635 A001041 A216425 Adjacent sequences:  A172008 A172009 A172010 * A172012 A172013 A172014 KEYWORD nonn,easy AUTHOR Claudio Peruzzi (claudio.peruzzi(AT)gmail.com), Jan 22 2010 EXTENSIONS Edited and extended by R. J. Mathar, Jan 23 2010 STATUS approved

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 January 18 09:26 EST 2022. Contains 350454 sequences. (Running on oeis4.)