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.

A225419 Triangle read by rows: T(n,k) (0 <= k <= n) = binomial(2*n+2,k).

This page as a plain text file.
%I A225419 #22 Apr 13 2014 13:48:56
%S A225419 1,1,4,1,6,15,1,8,28,56,1,10,45,120,210,1,12,66,220,495,792,1,14,91,
%T A225419 364,1001,2002,3003,1,16,120,560,1820,4368,8008,11440,1,18,153,816,
%U A225419 3060,8568,18564,31824,43758,1,20,190
%N A225419 Triangle read by rows: T(n,k) (0 <= k <= n) = binomial(2*n+2,k).
%C A225419 Row sums are A000346.
%H A225419 Roger L. Bagula, <a href="/A225419/a225419.txt">a225419nb.txt</a>
%e A225419 Triangle begins:
%e A225419 1,
%e A225419 1, 4,
%e A225419 1, 6, 15,
%e A225419 1, 8, 28, 56,
%e A225419 1, 10, 45, 120, 210,
%e A225419 1, 12, 66, 220, 495, 792,
%e A225419 1, 14, 91, 364, 1001, 2002, 3003,
%e A225419 ...
%t A225419 Flatten[Table[Table[DifferenceRoot[Function[{y, n}, {(-(2*m + 1) + n) y[n] + n y[1 + n] == 0, y[1] == 1}]][k], {k, 1, m}], {m, 1, 10}]]
%t A225419 Flatten[Table[Binomial[2n+2,k],{n,0,10},{k,0,n}]] (* _Harvey P. Dale_, Apr 13 2014 *)
%Y A225419 Cf. A127673, A062344, A034870, A000346.
%K A225419 nonn,tabl,easy
%O A225419 0,3
%A A225419 _Roger L. Bagula_, May 07 2013
%E A225419 Edited by _N. J. A. Sloane_, May 11 2013