OFFSET
0,3
COMMENTS
An integer partition of n with k parts can have its parts colored in n!/(n-k)! ways. a(n) is the sum of all these possibilities over all integer partitions of n. - Olivier Gérard, May 08 2012
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..449
MAPLE
b:= proc(n, i, p) option remember; `if`(n=0 or i=1,
p!/(p-n)!, b(n, i-1, p)+p*b(n-i, min(i, n-i), p-1))
end:
a:= n-> b(n$3):
seq(a(n), n=0..25); # Alois P. Heinz, Jan 21 2019
MATHEMATICA
b[n_, i_, p_] := b[n, i, p] = If[n == 0 || i == 1, p!/(p - n)!, b[n, i - 1, p] + p b[n - i, Min[i, n - i], p - 1]];
a[n_] := b[n, n, n];
a /@ Range[0, 25] (* Jean-François Alcover, Nov 23 2020, after Alois P. Heinz *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Alford Arnold, Jun 21 2010
EXTENSIONS
More terms and more direct definition by Olivier Gérard, May 08 2012
a(0)=1 prepended by Alois P. Heinz, Jan 21 2019
STATUS
approved