|
%I #2 Mar 30 2012 18:40:52
%S 2,36,1728,160000,24300000,5489031744,1727094849536,722204136308736,
%T 387420489000000000,259374246010000000000,211988959518950443450368,
%U 207728067204059288762843136,240396446553194784543350546432
%N Number of admissible graphs of order n.
%C In Kontsevich, by definition, an admissible graph of order n is an ordered pair of maps i; j : {1, 2, 3, ..., n} --> {1, 2, 3, ..., n, L, R} where neither map has fixed points and both maps are distinct at every point. See p.18 of Dimofte.
%D M. Kontsevich, Deformation quantization of Poisson manifolds, Lett. Math. Phys. 66 (2003), no. 3 157{216, [q-alg/9709040v1].
%H Tudor Dimofte, Sergei Gukov, <a href="http://arxiv.org/abs/1003.4808">Quantum Field Theory and the Volume Conjecture </a>, March 26, 2010.
%F a(n) = (n^n)*((n+1)^n) = (n*(n+1))^n. = A000312(n)*A000169(n+1).
%e a(1) = (1^1)*((1+1)^1) = 2.
%e a(2) = (2^2)*((2+1)^2) = 36.
%e a(3) = (3^3)*((3+1)^3) = 1728.
%e a(4) = (4^4)*((4+1)^4) = 160000.
%e a(5) = (5^5)*((5+1)^5) = 24300000.
%Y Cf. A000169, A000312.
%K easy,nonn
%O 1,1
%A _Jonathan Vos Post_, Mar 31 2010
|
