login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022193 Gaussian binomial coefficients [ n,10 ] for q = 2. 2
1, 2047, 2794155, 3269560515, 3571013994483, 3774561792168531, 3926442969043883795, 4052305562169692070035, 4165817792093527797314451, 4274137206973266943778085267, 4380990637147598617372537398675 (list; graph; refs; listen; history; text; internal format)
OFFSET
10,2
REFERENCES
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698.
LINKS
FORMULA
a(n) = Product_{i=1..10} (2^(n-i+1)-1)/(2^i-1), by definition. - Vincenzo Librandi, Aug 03 2016
MATHEMATICA
Table[QBinomial[n, 10, 2], {n, 10, 40}] (* Vincenzo Librandi, Aug 03 2016 *)
PROG
(Sage) [gaussian_binomial(n, 10, 2) for n in range(10, 21)] # Zerinvary Lajos, May 25 2009
(Magma) r:=10; q:=2; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // Vincenzo Librandi, Aug 03 2016
(PARI) r=10; q=2; for(n=r, 30, print1(prod(j=1, r, (1-q^(n-j+1))/(1-q^j)), ", ")) \\ G. C. Greubel, May 30 2018
CROSSREFS
Sequence in context: A321550 A014233 A160964 * A069386 A069412 A069438
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:57 EDT 2024. Contains 371265 sequences. (Running on oeis4.)