login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282735 Number of triangulations of a convex n-gon in the plane each of whose sides is subdivided by 2 points. 1
2, 29, 604, 13740, 332842, 8419334, 219829560, 5880376980, 160327187560, 4439180561629, 124485616405516, 3528306241927428, 100914357176842188, 2908920668838209340, 84423279647430363248, 2464811859798957024196, 72343319478816485276760, 2133323371103124457168580 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Lars Blomberg, Table of n, a(n) for n = 2..101

Andrei Asinowski, Christian Krattenthaler, Toufik Mansour, Counting triangulations of some classes of subdivided convex polygons, arXiv:1604.02870 [math.CO], 2016.

FORMULA

From Asinowski and Krattenthaler equation 2.7: a(n) = tr(n,3). - Lars Blomberg, Mar 04 2017

MATHEMATICA

tr[k_, r_] := Sum[(-1)^j 2^l Binomial[k, j] Binomial[k-2+l, l] Binomial[(r- 1)k-l-3, r k - (r+1)j-l-2], {j, 0, k}, {l, 0, r k - (r+1)j-2}];

a[n_] := tr[n, 3];

Table[a[n], {n, 2, 19}] (* Jean-François Alcover, Oct 10 2018 *)

CROSSREFS

Sequence in context: A187362 A176938 A006988 * A245252 A090251 A087281

Adjacent sequences:  A282732 A282733 A282734 * A282736 A282737 A282738

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mar 03 2017

EXTENSIONS

More terms from Lars Blomberg, Mar 04 2017

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 19:57 EDT 2020. Contains 336279 sequences. (Running on oeis4.)