This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A015291 Gaussian binomial coefficient [ n,4 ] for q = -5. 2

%I

%S 1,521,339171,210302171,131649159046,82254445109046,51412313316921546,

%T 32132285187903171546,20082729571968536374671,

%U 12551699566292514833249671,7844813030956382105126218421

%N Gaussian binomial coefficient [ n,4 ] for q = -5.

%D 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.

%D I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.

%D M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.

%H Vincenzo Librandi, <a href="/A015291/b015291.txt">Table of n, a(n) for n = 4..300</a>

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (521,67730,-1693250,-8140625,9765625).

%F G.f.: -x^4 / ( (x-1)*(5*x+1)*(25*x-1)*(625*x-1)*(125*x+1) ). - _R. J. Mathar_, Aug 03 2016

%t Table[QBinomial[n, 4, -5], {n, 4, 20}] (* _Vincenzo Librandi_, Oct 28 2012 *)

%o (Sage) [gaussian_binomial(n,4,-5) for n in xrange(4,15)] # _Zerinvary Lajos_, May 27 2009

%o (MAGMA) r:=4; q:=-5; [&*[(1-q^(n-i+1))/(1-q^i): i in [1..r]]: n in [r..20]]; // _Vincenzo Librandi_, Aug 02 2016

%K nonn,easy

%O 4,2

%A _Olivier GĂ©rard_, Dec 11 1999

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 April 22 10:18 EDT 2019. Contains 322330 sequences. (Running on oeis4.)