OFFSET
1,5
REFERENCES
J. H. Kwak and J. Lee, Enumeration of graph coverings, surface branched coverings and related group theory, in Combinatorial and Computational Mathematics (Pohang, 2000), ed. S. Hong et al., World Scientific, Singapore 2001, pp. 97-161.
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.13(c), pp. 76, 112.
LINKS
M. Hofmeister, A Note on Counting Connected Graph Covering Projections, SIAM J. Discrete Math., 11 (1998), 286-292. See page 291 Table 4.3.
J. H. Kwak and J. Lee, Enumeration of connected graph coverings, J. Graph Th., 23 (1996), 105-109.
J. H. Kwak and J. Lee, Enumeration of graph coverings and surface branched coverings, Lecture Note Series 1 (2001), Com^2MaC-KOSEF, Korea. See chapter 3.
V. A. Liskovets, Reductive enumeration under mutually orthogonal group actions, Acta Applic. Math., 52 (1998), 91-120.
EXAMPLE
Array T(n,k) begins:
1 1 1 1 1 1 1 ...
1 3 7 26 97 624 4163 ...
1 7 41 604 13753 504243 ...
1 15 235 14120 1712845 ...
CROSSREFS
KEYWORD
AUTHOR
N. J. A. Sloane, Sep 09 2000
EXTENSIONS
More terms from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Dec 25 2001
STATUS
approved