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.

A085919 Number of ways a loop can cross three roads meeting in a Y n times.

Original entry on oeis.org

3, 0, 3, 1, 9, 6, 45, 42, 279, 320, 1977, 2610, 15306, 22404, 126300, 200158, 1093515, 1846314, 9830547, 17481864
Offset: 0

Views

Author

N. J. A. Sloane and Jon Wild, Aug 25 2003

Keywords

Comments

The Mercedes-Benz problem: closed meanders crossing a Y.

Examples

			With three crossings the loop must cut each road exactly once, so a(3) = 1.
		

Crossrefs

Similar to A078104, but without the constraint of touching the (-, -) quadrant.