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.

A015207 Sum of Gaussian binomial coefficients for q=17.

This page as a plain text file.
%I A015207 #19 May 14 2019 11:10:35
%S A015207 1,2,20,616,99472,51647264,141339210560,1246922025235072,
%T A015207 57999437806769246464,8698341593509034791428608,
%U A015207 6878047564149771530513399567360,17535817352622479067842954626850351104,235723767989136531816996707739814303966793728
%N A015207 Sum of Gaussian binomial coefficients for q=17.
%D A015207 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 A015207 I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
%D A015207 M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
%H A015207 Vincenzo Librandi, <a href="/A015207/b015207.txt">Table of n, a(n) for n = 0..50</a>
%H A015207 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 A015207 a(0) = 1, a(1) = 2, a(n) = 2*a(n-1) + a(n-2)*((17^(n-1)) - 1). - _Vincenzo Librandi_, Nov 02 2012
%t A015207 Total/@Table[QBinomial[n, m, 17], {n, 0, 20}, {m, 0, n}] (* _Vincenzo Librandi_, Nov 02 2012 *)
%Y A015207 Row sums of triangle A022181.
%K A015207 nonn
%O A015207 0,2
%A A015207 _N. J. A. Sloane_, _Olivier Gérard_