Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069724
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069724 Number of nonisomorphic unrooted unicursal planar maps with n edges (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path). +0
7
1, 2, 9, 38, 214, 1253, 7925, 51620, 346307, 2365886, 16421359, 115384738, 819276830, 5868540399, 42357643916, 307753571520, 2249048959624, 16520782751969, 121915128678131, 903391034923548, 6719098772562182 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

FORMULA

There is an easy formula.

CROSSREFS

Cf. A069720, A069727, A005470.

Sequence in context: A001077 A105484 A057647 this_sequence A132961 A070017 A054129

Adjacent sequences: A069721 A069722 A069723 this_sequence A069725 A069726 A069727

KEYWORD

easy,nice,nonn

AUTHOR

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 September 8 13:07 EDT 2008. Contains 143486 sequences.


AT&T Labs Research