Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Nov 18 2023 08:36:49
%S 1,6,280,23100,2522520,325909584,47117214144,7383099180600,
%T 1229149289511000,214527522662653200,38887279926227853120,
%U 7271332144993605081120,1395321310426879365566400,273697641660657106322640000,54708248601655917595233984000
%N Number of tree-rooted planar maps with n+1 vertices and n+1 faces.
%C The number of edges is 2*n.
%C Also, a(n) is the number of discrete walks that start and stop at the origin, never pass below the x-axis nor to the left of the y-axis, and, in any order, have n steps that increment x, n steps that decrement x, n steps that increment y, and n steps that decrement y. It is in this sense a way to generalize the 2n-step one-dimensional walks counted by A000108 to a count in two dimensions. Proof: There are A001448(n) ways to interleave two length-2n Dyck words (A000108(n)^2) - _Lee A. Newberg_, Nov 17 2023
%H Andrew Howroyd, <a href="/A342983/b342983.txt">Table of n, a(n) for n = 0..200</a>
%F a(n) = (4*n)!/(n!*(n+1)!)^2.
%F a(n) = A000108(n)^2 * A001448(n) = A001246(n) * A001448(n). - _Alois P. Heinz_, Aug 02 2023
%o (PARI) a(n) = {(4*n)!/(n!*(n+1)!)^2}
%Y Central coefficients of A342982.
%Y Even bisection of A215288.
%Y Cf. A000108, A001246, A001448.
%K nonn
%O 0,2
%A _Andrew Howroyd_, Apr 03 2021