The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178801 Write n! partition(n) times. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE for n = 1, 2, 3, ... partition(n) (A000041) begins 1,2,3,5,7,11,15,... therefore a(n) begins 1,2,2,6,6,6,24,24,24,24,24,... MATHEMATICA Table[PadRight[{}, PartitionsP[n], n!], {n, 10}]//Flatten (* Harvey P. Dale, Apr 05 2020 *) CROSSREFS Cf. A000041 (shape sequence), A053529 (row sums), A066186, A036042 (write n partition(n) times) Sequence in context: A320140 A033742 A048594 * A130493 A267516 A163118 Adjacent sequences:  A178798 A178799 A178800 * A178802 A178803 A178804 KEYWORD easy,tabf,nonn AUTHOR Alford Arnold, Jun 15 2010 EXTENSIONS More terms from R. J. Mathar, Jun 19 2010 Name clarified by N. J. A. Sloane, Apr 05 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 09:54 EDT 2021. Contains 344981 sequences. (Running on oeis4.)