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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022206 Gaussian binomial coefficients [ n,7 ] for q = 4. 1
 1, 21845, 381767589, 6354157930725, 104514759495347685, 1714043588198181437925, 28089747579101385828291045, 460250514083576206796548772325, 7540859480106603961931048583270885, 123549912998815788062283863044996567525 (list; graph; refs; listen; history; text; internal format)
 OFFSET 7,2 REFERENCES F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 698. LINKS Vincenzo Librandi, Table of n, a(n) for n = 7..200 FORMULA G.f.: x^7/((1-x)*(1-4*x)*(1-16*x)*(1-64*x)*(1-256*x)*(1-1024*x)*(1-4096*x)*(1-16384*x)). - Vincenzo Librandi, Aug 11 2016 a(n) = Product_{i=1..7} (4^(n-i+1)-1)/(4^i-1), by definition. - Vincenzo Librandi, Aug 11 2016 MATHEMATICA Table[QBinomial[n, 7, 4], {n, 7, 20}] (* Vincenzo Librandi, Aug 11 2016 *) PROG (Sage) [gaussian_binomial(n, 7, 4) for n in range(7, 17)] # Zerinvary Lajos, May 27 2009 (Magma) r:=7; 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=7; q=4; for(n=r, 30, print1(prod(j=1, r, (1-q^(n-j+1))/(1-q^j)), ", ")) \\ G. C. Greubel, Jun 04 2018 CROSSREFS Sequence in context: A092006 A034623 A069312 * A251510 A083626 A234214 Adjacent sequences: A022203 A022204 A022205 * A022207 A022208 A022209 KEYWORD nonn,easy AUTHOR EXTENSIONS Offset changed by Vincenzo Librandi, Aug 11 2016 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.

Last modified January 29 23:01 EST 2023. Contains 359939 sequences. (Running on oeis4.)