|
Search: id:A000933
|
|
|
| A000933 |
|
Genus of complete graph on n nodes. (Formerly M0503 N0182)
|
|
+0 3
|
|
| 0, 0, 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8, 10, 11, 13, 16, 18, 20, 23, 26, 29, 32, 35, 39, 43, 46, 50, 55, 59, 63, 68, 73, 78, 83, 88, 94, 100, 105, 111, 118, 124, 130, 137, 144, 151, 158, 165, 173, 181, 188, 196, 205, 213, 221, 230, 239, 248, 257, 266, 276, 286, 295, 305
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
(1+x)*(1+x^3)*(1+x^5)/((1-x^2)*(1-x^4)*(1-x^6)) is the Poincare series (or Molien series) for symmetric invariants in F_2(b_1, b_2, ... b_n) \otimes E(e_1, e_2, ... e_n) with b_i 2-dimensional, e_i one-dimensional and the permutation action of S_n, in the case n=3.
|
|
REFERENCES
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
A. Adem and R. J. Milgram, Cohomology of Finite Groups, Springer-Verlag, 2nd. ed., 200
J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley, 1987; see I(n) p. 221.
J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 740.
G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc. Nat. Acad. Sci. USA, 60 (1968), 438-445.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
Eric Weisstein's World of Mathematics, Graph Genus
|
|
FORMULA
|
Euler transform of length 10 sequence [1, 0, 1, 1, 1, 0, 0, 0, 0, -1]. - Michael Somos, Aug 24 2005
G.f.: x^5*(1+x^5)/((1-x)*(1-x^3)*(1-x^4)).
a(n) = Ceiling ( (n-3)*(n-4)/12 ) if n>=3.
|
|
EXAMPLE
|
a(1)=a(2)=a(3)=a(4)=0 because K_4 is planar. a(5)=a(6)=a(7)=1 because K_7 can be embedded on the torus of genus 1.
|
|
MAPLE
|
A000933:=-z**4*(1-z+z**2-z**3+z**4)/(z**2+z+1)/(1+z**2)/(z-1)**3; [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
PROGRAM
|
(PARI) a(n)=if(n<3, 0, ceil((n-3)*(n-4)/12)) /* Michael Somos Aug 24 2005 */
|
|
CROSSREFS
|
Cf. A007997.
Sequence in context: A140642 A072666 A075471 this_sequence A036409 A005423 A067319
Adjacent sequences: A000930 A000931 A000932 this_sequence A000934 A000935 A000936
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.003 seconds
|