[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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.
0
1, 1, 56, 17550, 15249024, 28143753000, 94689953674560, 525169893772283760, 4469844204191484518400, 55337211594165488805417600, 955860613004397508326213120000, 22282564877342299983672172489536000, 682182070950002359574696677978908672000, 26812831292465310201469047550286967518976000
(list; graph; refs; listen; history; text; internal format)
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

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 23:09 EST 2024. Contains 377537 sequences.
License Agreements, Terms of Use, Privacy Policy