cp's OEIS Frontend

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.

%I A227053 #13 Dec 10 2024 14:31:41
%S A227053 1,1,56,17550,15249024,28143753000,94689953674560,525169893772283760,
%T A227053 4469844204191484518400,55337211594165488805417600,
%U A227053 955860613004397508326213120000,22282564877342299983672172489536000,682182070950002359574696677978908672000,26812831292465310201469047550286967518976000
%N 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.
%o A227053 (Python)
%o A227053 import math
%o A227053 for n in range(20):
%o A227053   print(math.factorial(n**3)//math.factorial(n**3-n), end=', ')
%Y A227053 Cf. A107444, A158362.
%K A227053 nonn,easy
%O A227053 0,3
%A A227053 _Alex Ratushnyak_, Jun 29 2013