|
|
A022205
|
|
Gaussian binomial coefficients [ n,6 ] for q = 4.
|
|
1
|
|
|
1, 5461, 23859109, 99277752549, 408235958349285, 1673768626404966885, 6857430062381149327845, 28089747579101385828291045, 115057361291389776393497498085, 471276749188750005563056686387685, 1930351405154232225472089767795511781
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,2
|
|
REFERENCES
|
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: x^6/((1-x)*(1-4*x)*(1-16*x)*(1-64*x)*(1-256*x)*(1-1024*x)*(1-4096*x)). - Vincenzo Librandi, Aug 11 2016
a(n) = Product_{i=1..6} (4^(n-i+1)-1)/(4^i-1), by definition. - Vincenzo Librandi, Aug 11 2016
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [gaussian_binomial(n, 6, 4) for n in range(6, 17)] # Zerinvary Lajos, May 27 2009
(Magma) r:=6; q:=4; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // Vincenzo Librandi, Aug 11 2016
(PARI) r=6; q=4; for(n=r, 30, print1(prod(j=1, r, (1-q^(n-j+1))/(1-q^j)), ", ")) \\ G. C. Greubel, Jun 01 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|