|
|
A069720
|
|
a(n) = 2^(n-1)*binomial(2n-1, n).
|
|
25
|
|
|
1, 6, 40, 280, 2016, 14784, 109824, 823680, 6223360, 47297536, 361181184, 2769055744, 21300428800, 164317593600, 1270722723840, 9848101109760, 76467608616960, 594748067020800, 4632774416793600, 36135640450990080, 282202144474398720, 2206307674981662720, 17266755717247795200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of rooted unicursal planar maps with n edges (unicursal means that exactly two nodes are of odd valency; there is an Eulerian path).
|
|
LINKS
|
|
|
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, Sep 06 2004
D-finite with recurrence n*a(n) + 4*(1-2n)*a(n-1) = 0. - R. J. Mathar, Apr 01 2012
E.g.f.: a(n) = n! * [x^n] (exp(4*x)*BesselI(0, 4*x) - 1)/4. - Peter Luschny, Aug 25 2012
Sum_{n>=1} 1/a(n) = 4/7 + 32*arcsin(1/(2*sqrt(2)))/(7*sqrt(7)).
Sum_{n>=1} (-1)^(n+1)/a(n) = 4/9 + 16*log(2)/27. (End)
|
|
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, Jan 01 2007
|
|
MATHEMATICA
|
Table[2^(n-1) Binomial[2n-1, n], {n, 20}] (* Harvey P. Dale, Jan 20 2013 *)
|
|
PROG
|
(Haskell)
a069720 n = (a000079 $ n - 1) * (a001700 $ n - 1)
|
|
CROSSREFS
|
First superdiagonal of number array A082137.
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|