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.

A323295 Number of ways to fill a matrix with the first n positive integers.

Original entry on oeis.org

1, 1, 4, 12, 72, 240, 2880, 10080, 161280, 1088640, 14515200, 79833600, 2874009600, 12454041600, 348713164800, 5230697472000, 104613949440000, 711374856192000, 38414242234368000, 243290200817664000, 14597412049059840000, 204363768686837760000
Offset: 0

Views

Author

Gus Wiseman, Jan 12 2019

Keywords

Examples

			The a(4) = 72 matrices consist of:
  24 row/column permutations of [1 2 3 4]
+
  4 row/column permutations of [1 2]
                               [3 4]
+
  4 row/column permutations of [1 2]
                               [4 3]
+
  4 row/column permutations of [1 3]
                               [2 4]
+
  4 row/column permutations of [1 3]
                               [4 2]
+
  4 row/column permutations of [1 4]
                               [2 3]
+
  4 row/column permutations of [1 4]
                               [3 2]
+
  24 row/column permutations of [1]
                                [2]
                                [3]
                                [4]
		

Crossrefs

Programs

  • Mathematica
    Join[{1}, Table[DivisorSigma[0, n]*n!, {n, 30}]]
  • PARI
    a(n) = if (n==0, 1, numdiv(n)*n!); \\ Michel Marcus, Jan 15 2019

Formula

a(n) = A000005(n) * n! for n > 0, a(0) = 1.
E.g.f.: 1 + Sum_{k>=1} x^k/(1 - x^k). - Ilya Gutkovskiy, Sep 13 2019