A178801 Write n! partition(n) times.

1, 1, 2, 2, 6, 6, 6, 24, 24, 24, 24, 24, 120, 120, 120, 120, 120, 120, 120, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 40320, 40320, 40320, 40320, 40320, 40320

Offset: 0

Author

Alford Arnold, Jun 15 2010

Keywords

• easy
• tabf
• nonn

Examples

			for n = 0, 1, 2, 3, ... partition(n) (A000041) begins 1,1,2,3,5,7,11,15,... therefore Triangle begins:
   1;
   1;
   2,  2;
   6,  6,  6;
  24, 24, 24, 24, 24;
  ...
		

Crossrefs

Cf. A000041 (shape sequence), A000142, A053529 (row sums), A066186, A036042 (write n partition(n) times).

Programs

Mathematica

Table[PadRight[{},PartitionsP[n],n!],{n,10}]//Flatten (* Harvey P. Dale, Apr 05 2020 *)

Extensions

More terms from R. J. Mathar, Jun 19 2010

Name clarified by N. J. A. Sloane, Apr 05 2020