A227053 a(n) = (n^3)! / (n^3-n)! = number of ways of placing n labeled balls into n^3 labeled boxes with at most one ball in each box.

1, 1, 56, 17550, 15249024, 28143753000, 94689953674560, 525169893772283760, 4469844204191484518400, 55337211594165488805417600, 955860613004397508326213120000, 22282564877342299983672172489536000, 682182070950002359574696677978908672000, 26812831292465310201469047550286967518976000

Offset

0,3

Links

Table of n, a(n) for n=0..13.

Prog

(Python)
import math
for n in range(20):
  print str(math.factorial(n**3)/math.factorial(n**3-n))+', ',

Crossrefs

Cf. A107444, A158362.

Sequence in context: A289204 A201726 A158362 * A115469 A153472 A202579

Adjacent sequences: A227050 A227051 A227052 * A227054 A227055 A227056

Keyword

nonn,easy

Author

Alex Ratushnyak, Jun 29 2013

Status

approved