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

Search: id:a295633
Showing 1-1 of 1

%I A295633 #10 Jan 14 2018 18:18:55
%S A295633 1,1,1,1,1,1,1,2,4,4,1,2,8,12,6,1,3,16,40,43,19,1,3,25,93,165,143,49,
%T A295633 1,4,40,197,505,712,504,150,1,4,56,364,1274,2548,2912,1768,442,1,5,80,
%U A295633 646,2878,7672,12400,11976,6310,1424,1,5,105,1050,5880,19992,42840,58140,48450,22610,4522
%N A295633 Triangle read by rows: T(n,k) = number of nonequivalent dissections of an n-gon into k polygons by nonintersecting diagonals up to rotation.
%H A295633 Andrew Howroyd, <a href="/A295633/b295633.txt">Table of n, a(n) for n = 3..1277</a>
%e A295633 Triangle begins: (n >= 3, k >= 1)
%e A295633 1;
%e A295633 1, 1;
%e A295633 1, 1,  1;
%e A295633 1, 2,  4,   4;
%e A295633 1, 2,  8,  12,    6;
%e A295633 1, 3, 16,  40,   43,   19;
%e A295633 1, 3, 25,  93,  165,  143,   49;
%e A295633 1, 4, 40, 197,  505,  712,  504,  150;
%e A295633 1, 4, 56, 364, 1274, 2548, 2912, 1768, 442;
%e A295633 ...
%o A295633 (PARI) \\ See A295495 for DissectionsModCyclic()
%o A295633 T=DissectionsModCyclic(apply(i->y, [1..12]));
%o A295633 for(n=3, #T, for(k=1, n-2, print1(polcoeff(T[n], k), ", ")); print)
%Y A295633 Row sums are A003455.
%Y A295633 Column k=3 is A003451.
%Y A295633 Diagonals include A001683, A220881, A003445, A220882.
%Y A295633 Cf. A295224, A295495, A295634.
%K A295633 nonn,tabl
%O A295633 3,8
%A A295633 _Andrew Howroyd_, Nov 24 2017

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