%I A003956
%S A003956 8,192,92160,743178240,97029351014400,203286581427673497600,
%T A003956 6819500449352277792129024000,3660967964237442812098963052691456000,
%U A003956 31446995505814020383166371418359014222725120000
%N A003956 Order of complex Clifford group of degree 2^n arising in quantum coding
theory.
%D A003956 B. Runge, Codes and Siegel modular forms, Discrete Math. 148 (1996),
175-204.
%H A003956 T. D. Noe, <a href="b003956.txt">Table of n, a(n) for n=0..20</a>
%H A003956 A. R. Calderbank, E. M. Rains, P. W. Shor and N. J. A. Sloane, <a href="http:/
/arXiv.org/abs/quant-ph/9608006">Quantum error correction via codes
over GF(4)</a>, IEEE Trans. Inform. Theory, 44 (1998), 1369-1387.
%H A003956 G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://arXiv.org/abs/
math.CO/0001038">The invariants of the Clifford groups</a>, Des.
Codes Crypt. 24 (2001), 99-121.
%H A003956 G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://www.research.att.com/
~njas/doc/cliff2.html">Self-Dual Codes and Invariant Theory</a>,
Springer, Berlin, 2006.
%p A003956 2^(n^2+2*n+3)*product( 4^j-1, j=1..n);
%Y A003956 Cf. A014116, A014115, A001309, A027672. Equals twice A027638.
%Y A003956 Sequence in context: A003435 A071303 A128406 this_sequence A041269 A103500
A119299
%Y A003956 Adjacent sequences: A003953 A003954 A003955 this_sequence A003957 A003958
A003959
%K A003956 nonn,easy,nice
%O A003956 0,1
%A A003956 N. J. A. Sloane (njas(AT)research.att.com), Peter Shor (shor(AT)math.mit.edu)
|