|
%I #8 May 03 2018 14:18:59
%S 1,0,1,1,4,7,26,69,246,818,2976,10791,40591,153959,594753,2320696,
%T 9159498,36467012,146411208,592046830,2409946566,9867745442,
%U 40623068380,168058068487,698400767839,2914407151002,12208398647345,51322369218674,216463504458521
%N Number of noncrossing path sets on n nodes up to rotation with each path having at least two nodes.
%H Andrew Howroyd, <a href="/A303844/b303844.txt">Table of n, a(n) for n = 0..200</a>
%e Case n=4: There are 4 possibilities:
%e .
%e o---o o o o---o o---o
%e | | / \
%e o---o o---o o---o o---o
%e .
%o (PARI) \\ See A303732 for NCPathSetsModCyclic
%o Vec(NCPathSetsModCyclic(vector(30, k, k>1)))
%Y Cf. A303730, A303732, A303836, A303839.
%K nonn
%O 0,5
%A _Andrew Howroyd_, May 01 2018
|
