Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069731
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069731 Number of unicursal planar maps with n edges rooted at a vertex of odd valency (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path). +0
1
1, 5, 28, 168, 1056, 6864, 45760, 311168, 2149888, 15049216, 106502144, 760729600, 5477253120, 39710085120, 289650032640, 2124100239360, 15651264921600, 115819360419840, 860372391690240 (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

a(n)=2^(n-2)*C_(n+1), where C_n stands for the Catalan numbers (A000108).

MAPLE

Z:=-(1-4*z-sqrt(1-4*z))/sqrt(1-4*z)/64: Zser:=series(Z, z=0, 32): seq(coeff(Zser*2^(n+1), z, n), n=3..24); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 01 2007

CROSSREFS

a(n)=A003645(n+2)/4

Cf. A069724, A069720, A000108, A003645.

Adjacent sequences: A069728 A069729 A069730 this_sequence A069732 A069733 A069734

Sequence in context: A025174 A083316 A027284 this_sequence A082031 A020081 A095676

KEYWORD

easy,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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research