%I #9 May 03 2018 14:38:42
%S 1,1,1,1,1,1,3,4,2,1,4,11,8,2,1,10,34,39,16,3,1,16,92,144,90,25,3,1,
%T 36,256,545,473,197,40,4,1,64,672,1878,2184,1246,370,56,4,1,136,1762,
%U 6296,9436,7130,2910,658,80,5,1,256,4480,20100,38025,36690,19698,6090,1080,105,5,1
%N Triangle read by rows: T(n,k) = number of noncrossing path sets on n nodes up to rotation with k paths and isolated vertices allowed.
%H Andrew Howroyd, <a href="/A303869/b303869.txt">Table of n, a(n) for n = 1..1275</a>
%e Triangle begins:
%e 1;
%e 1, 1;
%e 1, 1, 1;
%e 3, 4, 2, 1;
%e 4, 11, 8, 2, 1;
%e 10, 34, 39, 16, 3, 1;
%e 16, 92, 144, 90, 25, 3, 1;
%e 36, 256, 545, 473, 197, 40, 4, 1;
%e 64, 672, 1878, 2184, 1246, 370, 56, 4, 1;
%e 136, 1762, 6296, 9436, 7130, 2910, 658, 80, 5, 1;
%e ...
%o (PARI) \\ See A303732 for NCPathSetsModCyclic
%o { my(rows=Vec(NCPathSetsModCyclic(vector(10, k, y))-1));
%o for(n=1, #rows, for(k=1,n,print1(polcoeff(rows[n],k), ", ")); print;)}
%Y Row sums are A303836.
%Y Column 1 is A051437(n-3).
%Y Cf. A303844, A303732, A303864, A303868.
%K nonn,tabl
%O 1,7
%A _Andrew Howroyd_, May 01 2018