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 A095801 #20 Dec 13 2015 16:08:12 %S A095801 1,2,1,5,6,1,14,30,12,1,42,140,100,20,1,132,630,700,250,30,1,429,2772, %T A095801 4410,2450,525,42,1,1430,12012,25872,20580,6860,980,56,1,4862,51480, %U A095801 144144,155232,74088,16464,1680,72,1,16796,218790,772200,1081080,698544 %N A095801 Square of Narayana triangle A001263: View A001263 as a lower triangular matrix. Then the square of that matrix is also lower triangular. Sequence gives this lower triangle, read by rows. %C A095801 The first three columns are A000108 (the Catalan numbers), A002457 and A085374. %F A095801 T(n, k) = Sum_{i = k..n} A001263(n, i)*A001263(i, k). %F A095801 T(n, n-1) = n*(n-1). %e A095801 The first 3 rows are 1; 2, 1; 5, 6, 1; since the first 3 rows of the Narayana triangle in matrix format are M = [1 0 0 / 1 1 0 / 1 3 1]. Then M^2 = [1 0 0 / 2 1 0 / 5 6 1]. %e A095801 Triangle starts: %e A095801 1; %e A095801 2, 1; %e A095801 5, 6, 1; %e A095801 14, 30, 12, 1; %e A095801 42, 140, 100, 20, 1; %e A095801 ... %t A095801 t[n_, k_] = Sum[1/(i*k)*(Binomial[i-1, k-1]*Binomial[i, k-1]* Binomial[n-1, i-1]*Binomial[n, i-1]), {i, k, n}]; %t A095801 Flatten[Table[t[n, k], {n, 1, 10}, {k, 1, n}]][[1;;50]] (* _Jean-François Alcover_, Jul 21 2011 *) %Y A095801 Cf. A000108, A001263, A002457, A085374. %K A095801 nonn,easy,nice,tabl %O A095801 1,2 %A A095801 _Gary W. Adamson_, Jun 07 2004 %E A095801 Edited and extended by _David Wasserman_, Sep 24 2004