login
A symmetric factorial triangle, read by rows: T(n,k) = min(n,k)!.
1

%I #10 Sep 08 2013 19:59:14

%S 1,1,1,1,2,1,1,2,2,1,1,2,6,2,1,1,2,6,6,2,1,1,2,6,24,6,2,1,1,2,6,24,24,

%T 6,2,1,1,2,6,24,120,24,6,2,1,1,2,6,24,120,120,24,6,2,1,1,2,6,24,120,

%U 720,120,24,6,2,1,1,2,6,24,120,720,720,120,24,6,2,1

%N A symmetric factorial triangle, read by rows: T(n,k) = min(n,k)!.

%F Given A003983, replace each term with its factorial.

%e First few rows of the triangle are:

%e 1

%e 1, 1

%e 1, 2, 1

%e 1, 2, 2, 1

%e 1, 2, 6, 2, 1

%e 1, 2, 6, 6, 2, 1

%e 1, 2, 6, 24, 6, 2, 1 ...

%e Row having (1, 2, 3, 2, 1) in A003983 is replaced by (1, 2, 6, 2, 1) in A107044.

%Y Cf. A003983.

%K nonn,tabl

%O 1,5

%A _Gary W. Adamson_, May 09 2005

%E Edited by _Michael Kleber_, Apr 06 2009

%E Corrected by _Philippe Deléham_, Nov 07 2011