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.

A141476 Triangle T(n,k) = A000142(n-k)*A003319(k+1) read by rows.

This page as a plain text file.
%I A141476 #8 Feb 19 2018 03:35:43
%S A141476 1,1,1,2,1,3,6,2,3,13,24,6,6,13,71,120,24,18,26,71,461,720,120,72,78,
%T A141476 142,461,3447,5040,720,360,312,426,922,3447,29093,40320,5040,2160,
%U A141476 1560,1704,2766,6894,29093,273343,362880,40320,15120,9360,8520,11064,20682
%N A141476 Triangle T(n,k) = A000142(n-k)*A003319(k+1) read by rows.
%F A141476 Row sums: Sum_{k=0..n} T(n,k) = A000142(n+1) = (n+1)!.
%e A141476 The triangle starts at row n=0 with columns 0 <= k <= n:
%e A141476     1;
%e A141476     1,   1;
%e A141476     2,   1,   3;
%e A141476     6,   2,   3,  13;
%e A141476    24,   6,   6,  13,  71;
%e A141476   120,  24,  18,  26,  71, 461;
%t A141476 (* b = A003319 *) b[0]=0; b[n_] := b[n] = n! - Sum[k!*b[n-k], {k, 1, n-1}];
%t A141476 T[n_, k_] := (n-k)! b[k+1]; Table[T[n, k], {n, 0, 10}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Feb 18 2018 *)
%K A141476 nonn,tabl
%O A141476 0,4
%A A141476 _Paul Curtz_, Aug 09 2008
%E A141476 Edited and extended by _R. J. Mathar_, Dec 05 2008