%I M3698 #14 Apr 24 2013 03:03:19
%S 1,4,75,3456,300125,42467328,8931928887,2621440000000,
%T 1025271882697689,515978035200000000,325063112540091870659,
%U 250738401558910243700736,232526248038920243408203125,255326682647558617373989666816,327696095670976278474202880859375,486146690661928563361690196851556352
%N n^(n-2)*(n+2)^(n-1).
%D G. Kreweras, Complexite et circuits Euleriens dans les sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A006236/b006236.txt">Table of n, a(n) for n = 1..100</a>
%t Table[n^(n - 2)*(n + 2)^(n - 1), {n, 20}] (* _T. D. Noe_, May 29 2012 *)
%K nonn
%O 1,2
%A _N. J. A. Sloane_. Clarified definition, added more terms, May 27 2012.
|