login
Triangle read by rows: T(n,m) = m!, n >= 1.
10

%I #20 Jan 15 2025 21:11:33

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

%T 5040,1,2,6,24,120,720,5040,40320,1,2,6,24,120,720,5040,40320,362880,

%U 1,2,6,24,120,720,5040,40320,362880,3628800,1,2,6,24,120,720,5040,40320

%N Triangle read by rows: T(n,m) = m!, n >= 1.

%H Reinhard Zumkeller, <a href="/A166350/b166350.txt">Rows n=1..100 of triangle, flattened</a>

%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>

%F T(n,m) = A000142(m).

%e Triangle begins:

%e 1;

%e 1, 2;

%e 1, 2, 6;

%e 1, 2, 6, 24;

%e 1, 2, 6, 24, 120;

%e 1, 2, 6, 24, 120, 720;

%e 1, 2, 6, 24, 120, 720, 5040;

%e ...

%t Flatten[Table[Range[n]!,{n,11}]] (* _Harvey P. Dale_, Jan 06 2012 *)

%t Module[{nn=20,fs},fs=Range[nn]!;Table[Take[fs,n],{n,nn}]]//Flatten (* _Harvey P. Dale_, Jun 14 2020 *)

%o (Haskell)

%o import Data.List (inits)

%o a166350 n k = a166350_tabl !! (n-1) !! (n-1)

%o a166350_row n = a166350_tabl !! (n-1)

%o a166350_tabl = tail $ inits $ tail a000142_list

%o -- _Reinhard Zumkeller_, Nov 11 2013

%Y Cf. A000142, A002260, A094310, A077012, A079210.

%Y Cf. A014454.

%Y Row sums give A007489.

%K nonn,tabl

%O 1,3

%A _Paul Curtz_, Oct 12 2009

%E Definition clarified - _R. J. Mathar_, Oct 14 2009