login

Revision History for A069731

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
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).
(history; published version)
#21 by Michael De Vlieger at Wed May 01 11:29:04 EDT 2024
STATUS

reviewed

approved

#20 by Joerg Arndt at Wed May 01 11:05:26 EDT 2024
STATUS

proposed

reviewed

#19 by Peter Bala at Wed May 01 06:47:41 EDT 2024
STATUS

editing

proposed

#18 by Peter Bala at Mon Apr 29 08:21:23 EDT 2024
FORMULA

From Peter Bala, Apr 29 2024: (Start)

a(n) = Sum_{k = 0..n} binomial(n, 2*k)*Catalan(k)*4^(n-k-1). - _Peter Bala_, Apr 29 2024

O.g.f.: A(x) = (1 - 4*x - 8*x^2 - sqrt(1 - 8*x))/(32*x^2).

A(x) = series reversion of x*c(-x)/(1 + 4*x), where c(x) = (1 - sqrt(1 - 4*x))/(2*x) is the g.f. of the Catalan numbers A000108 and c(-x)/(1 + 4*x) is the g.f. of (-1)^n*A000346(n). (End)

CROSSREFS
#17 by Peter Bala at Mon Apr 29 07:58:46 EDT 2024
FORMULA

a(n) = Sum_{k = 0..n} binomial(n, 2*k)*Catalan(k)*4^(n-k-1). - Peter Bala, Apr 29 2024

CROSSREFS
STATUS

approved

editing

#16 by N. J. A. Sloane at Mon May 24 00:46:15 EDT 2021
STATUS

proposed

approved

#15 by Georg Fischer at Sun May 23 13:41:13 EDT 2021
STATUS

editing

proposed

#14 by Georg Fischer at Sun May 23 13:41:03 EDT 2021
FORMULA

D-finite with recurrence: 4*(2*n+1)*a(n-1) - (n+2)*a(n) = 0, a(1) = 1. - Georg Fischer, May 23 2021

STATUS

approved

editing

#13 by Joerg Arndt at Wed Aug 28 03:32:51 EDT 2019
STATUS

reviewed

approved

#12 by Michel Marcus at Wed Aug 28 02:29:38 EDT 2019
STATUS

proposed

reviewed