Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A342985

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

Showing entries 1-10 | older changes
Triangle read by rows: T(n,k) is the number of tree-rooted loopless planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1.
(history; published version)
#14 by Alois P. Heinz at Tue Apr 06 21:13:29 EDT 2021
STATUS

proposed

approved

#13 by Andrew Howroyd at Tue Apr 06 20:43:52 EDT 2021
STATUS

editing

proposed

#12 by Andrew Howroyd at Tue Apr 06 19:38:28 EDT 2021
LINKS

Andrew Howroyd, <a href="/A342985/b342985.txt">Table of n, a(n) for n = 0..1325</a> (rows 0..50)

T. R. S. Walsh, and A. B. Lehman, <a href="http://dx.doi.org/10.1016/0095-8956(75)90050-7">Counting rooted maps by genus. III: Nonseparable maps</a>, J. Combinatorial Theory Ser. B 18 (1975), 222-259, Table VIIIa.

PROG

H(n)={my(g=G(n, y)-x*(1+y), p=O(1)); while(serprec(p, x)<=n, p = subst(g, x, x*p^2)); my(v=Vec(psqrt(serreverse(x/g^2)/x))); vector(#v, n, Vecrev(v[n], n))}

STATUS

approved

editing

#11 by Alois P. Heinz at Sat Apr 03 22:50:51 EDT 2021
STATUS

proposed

approved

#10 by Andrew Howroyd at Sat Apr 03 22:19:06 EDT 2021
STATUS

editing

proposed

#9 by Andrew Howroyd at Sat Apr 03 22:18:16 EDT 2021
EXAMPLE

0, 8, 1568, 28400, 72676, 73700, 28400, 1568, 8, 0;

Discussion
Sat Apr 03
22:19
Andrew Howroyd: Code already fixed at #5 (forgot to recompute after!)
#8 by Andrew Howroyd at Sat Apr 03 22:15:27 EDT 2021
DATA

1, 0, 0, 0, 2, 0, 0, 3, 3, 0, 0, 4, 36, 4, 0, 0, 5, 135, 135, 5, 0, 0, 6, 360, 1368, 360, 6, 0, 0, 7, 798, 7350, 7350, 798, 7, 0, 0, 8, 1568, 28400, 72676, 73700, 28400, 1568, 8, 0, 0, 9, 2826, 89073, 466140, 466140, 474588, 474588, 89073, 2826, 9, 0, 0, 10, 4770, 241220, 2252534, 4671020, 2252534, 2292790, 4818092, 2292790, 241220, 4770, 10, 0

STATUS

approved

editing

#7 by Alois P. Heinz at Sat Apr 03 19:03:27 EDT 2021
STATUS

proposed

approved

#6 by Andrew Howroyd at Sat Apr 03 18:23:36 EDT 2021
STATUS

editing

proposed

#5 by Andrew Howroyd at Sat Apr 03 18:21:25 EDT 2021
PROG

H(n)={my(g=G(n, y)-x*(1+y), p=O(x1)); while(serprec(p, x)<=n, p = subst(g, x, x*p^2)); my(v=Vec(p)); vector(#v, n, Vecrev(v[n], n))}