Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077460
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077460 Number of nonisomorphic ways a loop can cross a road (running East-West) 2n times. +0
6
1, 1, 1, 3, 12, 70, 464, 3482, 27779, 233556 (list; graph; listen)
OFFSET

0,4

COMMENT

Nonisomorphic closed meanders, where two closed meanders are considered equivalent if one can be obtained from the other by reflections in an East-West or North-South mirror (a group of order 4).

EXAMPLE

A meander can be specified by marking 2n equally spaced points along a line, and recording the order in which the meander visits the points.

For n = 2, 4, 6, 8 the solutions are as follows:

n=2: 1 2

n=4: 1 2 3 4

n=6: 1 2 3 4 5 6, 1 2 3 6 5 4, 1 2 5 4 3 6

n=8: 1 2 3 4 5 6 7 8, 1 2 3 4 5 8 7 6, 1 2 3 4 7 6 5 8, 1 2 7 6 3 4 5 8, 1 2 3 6 7 8 5 4, 1 2 3 6 5 4 7 8, 1 2 7 6 5 4 3 8, 1 2 3 8 5 6 7 4, 1 2 3 8 7 4 5 6, 1 2 5 6 7 4 3 8, 1 2 7 4 5 6 3 8, 1 4 3 2 7 6 5 8

CROSSREFS

The total number of closed meanders with 2n crossings is given in A005315. Cf. A077055, A078104, A078105, A078591.

Sequence in context: A102078 A113341 A125862 this_sequence A001205 A112320 A103366

Adjacent sequences: A077457 A077458 A077459 this_sequence A077461 A077462 A077463

KEYWORD

nonn,nice

AUTHOR

njas and Jon Wild (wild(AT)music.mcgill.ca), Dec 03 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research