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.

A287221 Number of twice-crossing partitions on n nodes.

Original entry on oeis.org

0, 0, 0, 0, 8, 42, 168, 760, 2418, 10490, 30842, 131676
Offset: 0

Views

Author

Benedict W. J. Irwin, May 22 2017

Keywords

Comments

The meandric numbers A005316 are the numbers of paths which cross themselves 0 times.
This sequence is the number of paths that must cross themselves exactly twice.

Examples

			a(4) = 8; this is from the partitions
(2,1,4,3), (2,4,3,1),
(3,2,4,1), (3,4,2,1),
(4,1,3,2), (4,2,1,3),
(4,2,3,1), (4,3,1,2).
		

Crossrefs