Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003584
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003584 Unicursal (i.e. possessing an Eulerian path) planar rooted maps with n edges. +0
2
1, 2, 9, 52, 336, 2304, 16368, 118976, 878592, 6562816, 49447424, 375072768, 2860343296, 21909012480, 168425533440, 1298753372160, 10041201131520, 77809145610240, 604138825973760, 4698956908462080, 36604934482821120 (list; graph; listen)
OFFSET

0,2

COMMENT

Unicursal (in a broad sense) means that no more than two vertices are of odd valency (that is maps possessing an Eulerian path or cycle).

REFERENCES

V. A. Liskovets and T. R. S. Walsh, Enumeration of Eulerian and unicursal planar maps, Discr. Math., 282 (2004), 209-221.

CROSSREFS

Cf. A000257, A005470.

a(n)=A000257(n) + A069720(n)

Sequence in context: A026945 A009310 A091319 this_sequence A069271 A006152 A143508

Adjacent sequences: A003581 A003582 A003583 this_sequence A003585 A003586 A003587

KEYWORD

nonn,nice

AUTHOR

Valery A. Liskovets (liskov(AT)im.bas-net.by)

EXTENSIONS

More terms from Valery A. Liskovets (liskov(AT)im.bas-net.by), Apr 07 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research