OFFSET
0,2
COMMENTS
LINKS
R. Tauraso, Edge cover time for regular graphs, JIS 11 (2008) 08.4.4.
FORMULA
T(n, k) = C(k, n-k) + 2*C(k, n-k-1).
T(n, k) = Sum_{j = 0..n} (-1)^(n-j)*C(n, j)*C(j+k, 2*k)*(2*j+1)/(2*k+1).
From Peter Bala, Sep 10 2021: (Start)
T(n,k) = T(n-1,k-1) + T(n-2,k-1) with boundary conditions T(n,n) = 1, T(1,0) = 2 and T(n,k) = 0 for k < 0 or k > n.
The entries in row n, read in reverse order, are the coefficients in the n-th degree Taylor polynomial of (1 + x*c(-x))^(n+1) at x = 0, where c(x) = (1 - sqrt(1 - 4*x))/(2*x) is the g.f. of the Catalan numbers A000108. (End)
EXAMPLE
Triangle begins
1;
2, 1;
0, 3, 1;
0, 2, 4, 1;
0, 0, 5, 5, 1;
0, 0, 2, 9, 6, 1;
0, 0, 0, 7, 14, 7, 1;
0, 0, 0, 2, 16, 20, 8, 1;
Row 4: (1 + x*c(-x))^5 = 1 + 5*x + 5*x^2 + O(x^5). - Peter Bala, Sep 10 2021
CROSSREFS
KEYWORD
AUTHOR
Paul Barry, Oct 18 2005
STATUS
approved