id:A085919 - OEIS Search Results

Search: id:A085919

Displaying 1-1 of 1 results found.

page 1

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

+0
2

3, 0, 3, 1, 9, 6, 45, 42, 279, 320, 1977, 2610, 15306, 22404, 126300, 200158, 1093515, 1846314, 9830547, 17481864 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`The Mercedes-Benz problem: closed meanders crossing a Y.`
	LINKS	`Anonymous, Illustration for a(3) = 1`
	EXAMPLE	`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.` `Sequence in context: A127372 A051171 A166445 this_sequence A105824 A070298 A024938` `Adjacent sequences: A085916 A085917 A085918 this_sequence A085920 A085921 A085922`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com) and Jon Wild (wild(AT)music.mcgill.ca), Aug 25 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.