Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069720
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069720 a(n)=2^(n-1)C(2n-1,n) +0
17
1, 6, 40, 280, 2016, 14784, 109824, 823680, 6223360, 47297536, 361181184, 2769055744, 21300428800, 164317593600, 1270722723840, 9848101109760, 76467608616960, 594748067020800, 4632774416793600, 36135640450990080 (list; graph; listen)
OFFSET

1,2

COMMENT

Number of rooted unicursal planar maps with n edges (unicursal means that exactly two nodes are of odd valency; there is an Eulerian path).

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)*binomial(2n, n)

G.f. : (1-sqrt(1-8x))/(4x*sqrt(1-8x))=2/(sqrt(1-8x)(1-sqrt(1-8x)))-1/(2x). - Paul Barry (pbarry(AT)wit.ie), Sep 06 2004

MAPLE

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

CROSSREFS

First superdiagonal of number array A082137.

Cf. A069724, A003584, A069723, A082143.

Sequence in context: A083426 A122471 A090041 this_sequence A005037 A081337 A138240

Adjacent sequences: A069717 A069718 A069719 this_sequence A069721 A069722 A069723

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research