cp's OEIS Frontend

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.

A015210 Sum of Gaussian binomial coefficients for q=19.

This page as a plain text file.
%I A015210 #21 Mar 07 2024 09:56:46
%S A015210 1,2,22,764,152404,99869288,377566978168,4699193672889776,
%T A015210 337505849373783995536,79809726992391397235470112,
%U A015210 108909145140488785290568540059232,489318942025571053898957586140666992064,12686855492437023425546597742222336158113232704
%N A015210 Sum of Gaussian binomial coefficients for q=19.
%D A015210 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 A015210 I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
%D A015210 M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
%H A015210 Vincenzo Librandi, <a href="/A015210/b015210.txt">Table of n, a(n) for n = 0..50</a>
%H A015210 Kent E. Morrison, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL9/Morrison/morrison37.html">Integer Sequences and Matrices Over Finite Fields</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.
%F A015210 a(0) = 1, a(1) = 2, a(n) = 2*a(n-1) + a(n-2)*((19^(n-1)) - 1). - _Vincenzo Librandi_, Nov 02 2012
%t A015210 Total/@Table[QBinomial[n, m, 19], {n, 0, 20}, {m, 0, n}] (* _Vincenzo Librandi_, Nov 02 2012 *)
%Y A015210 Row sums of triangle A022183.
%K A015210 nonn
%O A015210 0,2
%A A015210 _N. J. A. Sloane_, _Olivier Gérard_