The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022210 Gaussian binomial coefficients [ n,11 ] for q = 4. 1
 1, 5592405, 25019996065701, 106607206793565997285, 448896535558672700374937061, 1884649011792085827682980366254565, 7906721240160746987619507371870782509541, 33165216768196105736186294932151329554455695845 (list; graph; refs; listen; history; text; internal format)
 OFFSET 11,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 = 11..160 FORMULA G.f.: x^11/((1-x)*(1-4*x)*(1-16*x)*(1-64*x)*(1-256*x)*(1-1024*x)*(1-4096*x)*(1-16384*x)*(1-65536*x)*(1-262144*x)*(1-1048576*x)*(1-4194304*x)). - Vincenzo Librandi, Aug 11 2016 a(n) = Product_{i=1..11} (4^(n-i+1)-1)/(4^i-1), by definition. - Vincenzo Librandi, Aug 11 2016 MATHEMATICA Table[QBinomial[n, 11, 4], {n, 11, 20}] (* Vincenzo Librandi, Aug 11 2016 *) PROG (Sage) [gaussian_binomial(n, 11, 4) for n in range(11, 19)] # Zerinvary Lajos, May 28 2009 (MAGMA) r:=11; 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=11; 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: A143686 A210011 A069316 * A057882 A210163 A114685 Adjacent sequences:  A022207 A022208 A022209 * A022211 A022212 A022213 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 23:45 EDT 2020. Contains 336434 sequences. (Running on oeis4.)