|
|
A003956
|
|
Order of complex Clifford group of degree 2^n arising in quantum coding theory.
|
|
14
|
|
|
8, 192, 92160, 743178240, 97029351014400, 203286581427673497600, 6819500449352277792129024000, 3660967964237442812098963052691456000, 31446995505814020383166371418359014222725120000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
MAPLE
|
a(n):= 2^(n^2+2*n+3)*mul(4^j-1, j=1..n); seq(a(n), n=0..10); # modified by G. C. Greubel, Sep 24 2019
|
|
MATHEMATICA
|
Table[2^(n^2+2n+3) Product[4^j-1, {j, n}], {n, 0, 10}] (* Harvey P. Dale, Nov 03 2017 *)
|
|
PROG
|
(PARI) vector(11, n, 2^(n^2 +2)*prod(j=1, n-1, 4^j-1) ) \\ G. C. Greubel, Sep 24 2019
(Magma) [n eq 0 select 8 else 2^((n+1)^2+2)*(&*[4^j-1: j in [1..n]]): n in [0..10]]; // G. C. Greubel, Sep 24 2019
(Sage) [2^((n+1)^2 +2)*product(4^j -1 for j in (1..n)) for n in (0..10)] # G. C. Greubel, Sep 24 2019
(GAP) List([0..10], n-> 2^((n+1)^2 +2)*Product([1..n], j-> 4^j -1) ); # G. C. Greubel, Sep 24 2019
(Python)
from math import prod
def A003956(n): return prod((1<<i)-1 for i in range(2, 2*n+1, 2)) << n*(n+2)+3 # Chai Wah Wu, Jun 20 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|