OFFSET
1,2
COMMENTS
Number of ways to arrange the numbers 1, 2, .., n=i*j into an i*j rectangle so that each row and each column is increasing.
a(p) = 2 for prime p. - Alois P. Heinz, Jul 25 2012
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..350
FORMULA
a(n) = n! * Sum_{i|n} Product_{k=0..n/i-1} k!/(i+k)!. - Alois P. Heinz, Jul 25 2012
MAPLE
with(numtheory):
a:= n-> n! * add(mul(k!/(i+k)!, k=0..(n/i)-1), i=divisors(n)):
seq(a(n), n=1..40); # Alois P. Heinz, Jul 25 2012
MATHEMATICA
a[n_] := n! * Sum[Product[k!/(i+k)!, {k, 0, n/i-1}], {i, Divisors[n]}]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Jul 02 2015, after Alois P. Heinz *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Naohiro Nomoto, Feb 20 2002
EXTENSIONS
Better name from Joerg Arndt, Feb 24 2014
STATUS
approved