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.

A303844 Number of noncrossing path sets on n nodes up to rotation with each path having at least two nodes.

Original entry on oeis.org

1, 0, 1, 1, 4, 7, 26, 69, 246, 818, 2976, 10791, 40591, 153959, 594753, 2320696, 9159498, 36467012, 146411208, 592046830, 2409946566, 9867745442, 40623068380, 168058068487, 698400767839, 2914407151002, 12208398647345, 51322369218674, 216463504458521
Offset: 0

Views

Author

Andrew Howroyd, May 01 2018

Keywords

Examples

			Case n=4: There are 4 possibilities:
.
   o---o   o   o   o---o   o---o
           |   |     /       \
   o---o   o---o   o---o   o---o
.
		

Crossrefs

Programs

  • PARI
    \\ See A303732 for NCPathSetsModCyclic
    Vec(NCPathSetsModCyclic(vector(30, k, k>1)))