cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

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

Views

Author

Alex Ratushnyak, Jun 29 2013

Keywords

Crossrefs

Programs

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