This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A015291 #24 Sep 08 2022 08:44:39
%S A015291 1,521,339171,210302171,131649159046,82254445109046,51412313316921546,
%T A015291 32132285187903171546,20082729571968536374671,
%U A015291 12551699566292514833249671,7844813030956382105126218421
%N A015291 Gaussian binomial coefficient [ n,4 ] for q = -5.
%D A015291 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 A015291 I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
%D A015291 M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
%H A015291 Vincenzo Librandi, <a href="/A015291/b015291.txt">Table of n, a(n) for n = 4..300</a>
%H A015291 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (521,67730,-1693250,-8140625,9765625).
%F A015291 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 A015291 Table[QBinomial[n, 4, -5], {n, 4, 20}] (* _Vincenzo Librandi_, Oct 28 2012 *)
%o A015291 (Sage) [gaussian_binomial(n,4,-5) for n in range(4,15)] # _Zerinvary Lajos_, May 27 2009
%o A015291 (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 A015291 nonn,easy
%O A015291 4,2
%A A015291 _Olivier Gérard_, Dec 11 1999