|
|
A069722
|
|
Number of rooted unicursal planar maps with n edges and exactly one vertex of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
|
|
5
|
|
|
0, 4, 24, 160, 1120, 8064, 59136, 439296, 3294720, 24893440, 189190144, 1444724736, 11076222976, 85201715200, 657270374400, 5082890895360, 39392404439040, 305870434467840, 2378992268083200, 18531097667174400, 144542561803960320, 1128808577897594880
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2^(n-1)*binomial(2n-2, n-1), n>1.
G.f. for a(n)^2: 1/AGM(1, (1-64*x)^(1/2)). - Benoit Cloitre, Jan 01 2004
E.g.f.: x * (exp(4*x) * (BesselI(0,4*x) - BesselI(1,4*x)) - 1). - Ilya Gutkovskiy, Nov 03 2021
Sum_{n>=2} 1/a(n) = 1/7 + 8*arcsin(1/(2*sqrt(2)))/(7*sqrt(7)).
Sum_{n>=2} (-1)^n/a(n) = 1/9 + 4*log(2)/27. (End)
|
|
MAPLE
|
Z:=(1-sqrt(1-z))*8^n/sqrt(1-z): Zser:=series(Z, z=0, 32): seq(coeff(Zser, z, n), n=0..19); # Zerinvary Lajos, Jan 01 2007
|
|
MATHEMATICA
|
Join[{0}, Table[2^(n-1) Binomial[2n-2, n-1], {n, 2, 20}]] (* Harvey P. Dale, Nov 16 2011 *)
|
|
PROG
|
(Magma) [0] cat[2^(n-1)*Binomial(2*n-2, n-1): n in [2..20]]; // Vincenzo Librandi, Nov 17 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|