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.

A071800 Number of lattice paths in the lattice [0..2n] X [0..2n] X [0..2n] which do not pass through the point (n,n,n). Number of paths through a lattice containing a "hole".

Original entry on oeis.org

54, 26550, 14330736, 8264889270, 4978317147804, 3090501687886704, 1961313438507566400, 1265749551338006549430, 827693426702217868006500, 547017649101008848332870300, 364691794467483796757326646400, 244920478151771001164678945670000
Offset: 1

Views

Author

T. D. Noe, Jun 06 2002

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Factorial[6n]/Factorial[2n]^3-(Factorial[3n]/Factorial[n]^3)^2, {n, 1, 10}]

Formula

a(n) = s(3,2n)-s(3,n)^2.