cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A303836 Number of noncrossing path sets on n nodes up to rotation with isolated vertices allowed.

This page as a plain text file.
%I A303836 #16 May 03 2018 17:03:29
%S A303836 1,1,2,3,10,26,103,371,1552,6475,28414,126530,577188,2670332,12538434,
%T A303836 59554199,285882600,1384875627,6763821250,33276183371,164789380052,
%U A303836 820923863918,4111708742153,20695831549310,104642143845428,531295928725508,2707906874407464
%N A303836 Number of noncrossing path sets on n nodes up to rotation with isolated vertices allowed.
%H A303836 Andrew Howroyd, <a href="/A303836/b303836.txt">Table of n, a(n) for n = 0..200</a>
%e A303836 Case n=4: There are 10 possibilities:
%e A303836 .
%e A303836    o   o    o   o    o   o    o   o    o---o
%e A303836                        /      |
%e A303836    o   o    o---o    o   o    o---o    o---o
%e A303836 .
%e A303836    o   o    o   o    o   o    o---o    o---o
%e A303836      /        \      |   |      /        \
%e A303836    o---o    o---o    o---o    o---o    o---o
%e A303836 .
%o A303836 (PARI) \\ See A303732 for NCPathSetsModCyclic
%o A303836 Vec(NCPathSetsModCyclic(vector(30, k, 1)))
%Y A303836 Row sums of A303869.
%Y A303836 Cf. A303732, A303844.
%K A303836 nonn
%O A303836 0,3
%A A303836 _Andrew Howroyd_, May 01 2018