# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a066368
Showing 1-1 of 1

%I A066368 #18 Jul 23 2019 08:11:18
%S A066368 1,1,4,14,40,102,244,562,1264,2798,6124,13290,28648,61414,131044,
%T A066368 278498,589792,1245150,2621404,5504986,11534296,24117206,50331604,
%U A066368 104857554,218103760,452984782,939524044,1946157002,4026531784
%N A066368 a(n) = (n+2)*2^(n-1) - 2*n.
%H A066368 Harry J. Smith, <a href="/A066368/b066368.txt">Table of n, a(n) for n = 0..200</a>
%H A066368 M. Azaola and F. Santos, <a href="http://personales.unican.es/santosf/Articulos/">The number of triangulations of the cyclic polytope C(n,n-4)</a>, Discrete Comput. Geom., 27 (2002), 29-48.
%H A066368 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (6,-13,12,-4).
%F A066368 G.f.: (1-5*x+11*x^2-9*x^3)/((1-x)^2*(1-2*x)^2). - _Colin Barker_, Apr 19 2012
%t A066368 Table[(n+2)2^(n-1)-2n,{n,0,30}] (* _Harvey P. Dale_, Apr 18 2019 *)
%o A066368 (PARI) { for (n=0, 200, write("b066368.txt", n, " ", (n + 2)*2^(n - 1) - 2*n) ) } \\ _Harry J. Smith_, Feb 11 2010
%K A066368 nonn,easy
%O A066368 0,3
%A A066368 _N. J. A. Sloane_, Jan 04 2002

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE