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.

A178803 Write the factorial of each term in A036043(n).

Original entry on oeis.org

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

Views

Author

Alford Arnold, Jun 17 2010

Keywords

Comments

Sequence A036043 measures the length of numeric partitions.

Examples

			A036043 begins 1 1 2 1 2 3 1 2 2 3 4 1 2 2 3 3 4 5 ...
so this table begins 1 1 2 1 2 6 1 2 2 6 24 ...
1;
1, 2;
1, 2, 6;
1, 2, 2, 6, 24;
1, 2, 2, 6, 6, 24, 120;
1, 2, 2, 2, 6, 6, 6, 24, 24, 120, 720;
1, 2, 2, 2, 6, 6, 6, 6, 24, 24, 24, 120, 120, 720, 5040;
1, 2, 2, 2, 2, 6, 6, 6, 6, 6, 24, 24, 24, 24, 24, 120, 120, 120, 720, 720, 5040, 40320;
		

Crossrefs

Cf. A000041 (shape sequence), A000142 (factorials), A036043, A101880 (row sums).

Programs

  • SageMath
    def A178803_row(n):
        return [factorial(len(p)) for k in (0..n) for p in Partitions(n, length=k)]
    for n in (0..10): print(A178803_row(n)) # Peter Luschny, Nov 02 2019