|
| |
|
|
A066373
|
|
(3*n-2)*2^(n-3).
|
|
5
|
|
|
|
2, 7, 20, 52, 128, 304, 704, 1600, 3584, 7936, 17408, 37888, 81920, 176128, 376832, 802816, 1703936, 3604480, 7602176, 15990784, 33554432, 70254592, 146800640, 306184192, 637534208, 1325400064, 2751463424, 5704253440
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
2,1
|
|
|
COMMENTS
|
An elephant sequence, see A175654. For the corner squares 16 A[5] vectors, with decimal values between 59 and 440, lead to this sequence (with a leading 1 added). For the central square these vectors lead to the companion sequence A098156 (without a(1)). - Johannes W. Meijer_, Aug 15 2010
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=2,...,200
M. Azaola and F. Santos, The number of triangulations of the cyclic polytope C(n,n-4), Discrete Comput. Geom., 27 (2002), 29-48.
Index to sequences with linear recurrences with constant coefficients, signature (4,-4).
|
|
|
FORMULA
|
G.f.= x^2*(2-x)/(1-2x)^2. - Emeric Deutsch, Jul 23 2006
a(n) = 2*a(n-1) +3*2^(n-3). - Vincenzo Librandi, Mar 20 2011
a(n+1)-a(n) = A098156(n). - R. J. Mathar, Apr 25 2013
|
|
|
MAPLE
|
seq((3*n-2)*2^(n-3), n=2..30); - Emeric Deutsch, Jul 23 2006
|
|
|
PROG
|
(PARI) { for (n=2, 200, write("b066373.txt", n, " ", (3*n - 2)*2^(n - 3)) ) } /* Harry J. Smith, Feb 11 2010 */
|
|
|
CROSSREFS
|
Sequence in context: A090145 A123203 A134311 * A096005 A050532 A050513
Adjacent sequences: A066370 A066371 A066372 * A066374 A066375 A066376
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane, Jan 04 2002
|
|
|
STATUS
|
approved
|
| |
|
|
