cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A238360 Number of genus-10 rooted maps with n edges.

This page as a plain text file.
%I A238360 #26 Jan 18 2025 18:33:37
%S A238360 15230046989184655753125,5199629454143883380553750,
%T A238360 909887917857275652461097750,108861830345440643086946970900,
%U A238360 10021124647635764856828690342402,757187906770815991999545249667404,48918614114003431712044170834572688,2779227352989564224315657269511192976,141720718575991991799057452443438430580
%N A238360 Number of genus-10 rooted maps with n edges.
%H A238360 Andrew Howroyd, <a href="/A238360/b238360.txt">Table of n, a(n) for n = 20..200</a>
%H A238360 Sean R. Carrell and Guillaume Chapuy, <a href="http://arxiv.org/abs/1402.6300">Simple recurrence formulas to count maps on orientable surfaces</a>, arXiv:1402.6300 [math.CO], (19-March-2014).
%H A238360 Gheorghe Coserea, <a href="/A238360/a238360.txt">The g.f. as a rational function of y=A005159(x)</a>
%H A238360 Steven R. Finch, <a href="https://arxiv.org/abs/2408.12440">An exceptional convolutional recurrence</a>, arXiv:2408.12440 [math.CO], 22 Aug 2024.
%t A238360 T[0, 0] = 1; T[n_, g_] /; g < 0 || g > n/2 = 0; T[n_, g_] := T[n, g] = ((4 n - 2)/3 T[n - 1, g] + (2 n - 3) (2 n - 2) (2 n - 1)/12 T[n - 2, g - 1] + 1/2 Sum[(2 k - 1) (2 (n - k) - 1) T[k - 1, i] T[n - k - 1, g - i], {k, 1, n - 1}, {i, 0, g}])/((n + 1)/6);
%t A238360 a[n_] := T[n, 10];
%t A238360 Table[a[n], {n, 20, 30}] (* _Jean-François Alcover_, Jul 20 2018 *)
%o A238360 (PARI) \\ see A238396
%Y A238360 Column g=10 of A269919.
%Y A238360 Rooted maps with n edges of genus g for 0 <= g <= 10: A000168, A006300, A006301, A104742, A215402, A238355, A238356, A238357, A238358, A238359, this sequence.
%K A238360 nonn
%O A238360 20,1
%A A238360 _Joerg Arndt_, Feb 26 2014