|
|
A006098
|
|
Gaussian binomial coefficient [ 2n,n ] for q=2.
(Formerly M3138)
|
|
3
|
|
|
1, 3, 35, 1395, 200787, 109221651, 230674393235, 1919209135381395, 63379954960524853651, 8339787869494479328087443, 4380990637147598617372537398675, 9196575543360038413217351554014467475, 77184136346814161837268404381760884963259795
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
J. Goldman and G.-C. Rota, The number of subspaces of a vector space, pp. 75-83 of W. T. Tutte, editor, Recent Progress in Combinatorics. Academic Press, NY, 1969.
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[QBinomial[2n, n, 2], {n, 0, 20}] (* Harvey P. Dale, Oct 22 2012 *)
|
|
PROG
|
(Sage) [gaussian_binomial(2*n, n, 2) for n in range(0, 11)] # Zerinvary Lajos, May 25 2009
(PARI) q=2; {a(n) = prod(j=0, n-1, (1-q^(2*n-j))/(1-q^(j+1))) };
(Magma) q:=2; [n le 0 select 1 else (&*[(1-q^(2*n-j))/(1-q^(j+1)): j in [0..n-1]]): n in [0..15]]; // G. C. Greubel, Mar 09 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|