%I #24 Jun 20 2024 16:25:43
%S 4,96,46080,371589120,48514675507200,101643290713836748800,
%T 3409750224676138896064512000,1830483982118721406049481526345728000,
%U 15723497752907010191583185709179507111362560000
%N Order of 2^n X 2^n unitary group H_n acting on Siegel modular forms.
%D B. Runge, On Siegel modular forms I, J. Reine Angew. Math., 436 (1993), 57-85.
%H G. C. Greubel, <a href="/A027638/b027638.txt">Table of n, a(n) for n = 0..39</a>
%H Simon Burton, Elijah Durso-Sabina, and Natalie C. Brown, <a href="https://arxiv.org/abs/2406.09951">Genons, Double Covers and Fault-tolerant Clifford Gates</a>, arXiv:2406.09951 [quant-ph], 2024. See p. 18.
%H B. Runge, <a href="https://doi.org/10.1016/0012-365X(94)00271-J">Codes and Siegel modular forms</a>, Discrete Math. 148 (1996), 175-204.
%H <a href="/index/Gre#groups_modular">Index entries for sequences related to modular groups</a>
%F a(n) = A003956(n)/2.
%F a(n) = 2^(n^2 + 2*n + 2) * Product_{j=1..n} (4^j - 1).
%p seq( 2^(n^2+2*n+2)*product(4^i -1, i=1..n), n=0..12);
%t Table[2^(n^2+2n+2) Product[4^k-1,{k,n}],{n,0,10}] (* _Harvey P. Dale_, May 21 2018 *)
%o (Magma)
%o A027638:= func< n | n eq 0 select 4 else 2^(n^2+2*n+2)*(&*[4^j-1: j in [1..n]]) >;
%o [A027638(n): n in [0..15]]; // _G. C. Greubel_, Aug 04 2022
%o (SageMath)
%o from sage.combinat.q_analogues import q_pochhammer
%o def A027638(n): return (-1)^n*2^(n^2 + 2*n + 2)*q_pochhammer(n, 4, 4)
%o [A027638(n) for n in (0..15)] # _G. C. Greubel_, Aug 04 2022
%o (PARI) a(n) = my(ret=1); for(i=1,n, ret = ret<<(2*i)-ret); ret << (n^2+2*n+2); \\ _Kevin Ryde_, Aug 13 2022
%Y Cf. A003956, A027672, A027639.
%K nonn,easy,nice
%O 0,1
%A _N. J. A. Sloane_