

A057005


Number of conjugacy classes of subgroups of index n in free group of rank 2.


13



1, 3, 7, 26, 97, 624, 4163, 34470, 314493, 3202839, 35704007, 433460014, 5687955737, 80257406982, 1211781910755, 19496955286194, 333041104402877, 6019770408287089, 114794574818830735, 2303332664693034476, 48509766592893402121, 1069983257460254131272
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Number of (unlabeled) dessins d'enfants with n edges. A dessin d'enfant ("child's drawing") by A. Grothendieck, 1984, is a connected bipartite multigraph with properly bicolored nodes (w and b) in which a cyclic order of the incident edges is assigned to every node. For n=2 these are wbw, bwb and w==b.  Valery A. Liskovets, Mar 17 2005
Also (apparently), a(n+1) = number of sensed hypermaps with n darts on a surface of any genus (see Walsh 2012).  N. J. A. Sloane, Aug 01 2012
Response from Timothy R. Walsh, Aug 01 2012: The conjecture in the previous comment is true. A combinatorial map is a connected graph, loops and multiple edges allowed, in which a cyclic order of the incident edgeends is assigned to every node. The equivalence between combinatorial maps and topological maps was conjectured by several researchers and finally proved by Jones and Singerman. In my 1975 paper "Generating nonisomorphic maps without storing them", I established a genuspreserving bijection between hypermaps with n darts, w vertices and b edges and properly bicoloured bipartite maps with n edges, w white vertices and b black vertices. A bipartite map can't have any loops; so a combinatorial bipartite map is a multigraph and it suffices to impose a cyclic order of the edges, rather than the edgeends, incident to each node. Thus it is just the child's drawing described above by Liskovets.


REFERENCES

R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.13(c), pp. 76, 112.


LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..450
M. Deryagina, On the enumeration of hypermaps which are selfequivalent with respect to reversing the colors of vertices, Preprint 2016.
J. B. Geloun, S. Ramgoolam, Counting Tensor Model Observables and Branched Covers of the 2Sphere, arXiv preprint arXiv:1307.6490, 2013
G. A. Jones and D. Singerman, Theory of maps on orientable surfaces, Proc. London Math. Soc. (3) 37:2 (1978), 273307.
J. H. Kwak and J. Lee, Enumeration of connected graph coverings, J. Graph Th., 23 (1996), 105109.
J. H. Kwak and J. Lee, Enumeration of graph coverings and surface branched coverings, Lecture Note Series 1 (2001), Com^2MaCKOSEF, Korea. See chapter 3.
V. A. Liskovets, Reductive enumeration under mutually orthogonal group actions, Acta Applic. Math., 52 (1998), 91120.
Carlos I. PérezSánchez, The full WardTakahashi Identity for colored tensor models, arXiv preprint arXiv:1608.08134 [mathph], 2016.
Timothy R. Walsh, Spaceefficient generation of nonisomorphic maps and hypermaps
Timothy R. Walsh, Generating nonisomorphic maps without storing them, SIAM J. Algebraic Discrete Methods 4 (1983), no. 2, 161178.
T. R. Walsh, SpaceEfficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
L. Zapponi, What is a dessin d'enfant?, Notices AMS, 50:7, 2003, 788789.
Index entries for sequences related to groups


FORMULA

prod_{n>0} (1x^n)^{a(n)} = prod_{i>0} sum_{j>=0} j!*i^j*x^{i*j}. (Liskovets)  Valery A. Liskovets, Mar 17 2005 ... and both sides = sum_{j>=0} A110143(j)*x^j .  R. J. Mathar, Oct 18 2012


MATHEMATICA

Unprotect[Power]; 0^0 = 1; Clear[f]; f[1] = {a[0] > 0, a[1] > 1}; f[max_] := f[max] = (p1 = Product[(1x^n)^(a[n]), {n, 0, max}]; p2 = Product[Sum[j!*i^j*x^(i*j), {j, 0, max}], {i, 0, max}]; s = Series[p1p2 /. f[max1], {x, 0, max}] // Normal // Expand; sol = Thread[CoefficientList[s, x] == 0] // Solve // First; Join[f[max1], sol]); Array[a, 22] /. f[22] (* JeanFrançois Alcover, Mar 11 2014 *)


CROSSREFS

Cf. A057004A057013.
Sequence in context: A184459 A215018 A069738 * A158561 A252786 A108217
Adjacent sequences: A057002 A057003 A057004 * A057006 A057007 A057008


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, Sep 09 2000


EXTENSIONS

More terms from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Dec 25 2001


STATUS

approved



