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.

A194605 Number of ways to place 2 nonattacking kings on an n X n X n X n raumschach board (four-dimensional chessboard).

Original entry on oeis.org

0, 0, 0, 2080, 27768, 181032, 807040, 2817240, 8271480, 21328048, 49692672, 106717680, 214322680, 406928280, 736614528, 1279735912, 2145244920, 3484996320, 5506324480, 8487206208, 12794341752, 18904506760, 27429548160, 39145417080, 55025652088, 76279746192
Offset: 0

Views

Author

Andrew Woods, Aug 30 2011

Keywords

Crossrefs

Cf. A194604 for the general d-dimensional case.

Formula

a(n) = (n^8 - (3*n-2)^4) / 2 for n>0.
G.f.: 8*x^3*(260+1131*x+750*x^2+335*x^3+75*x^4-30*x^5-x^6)/(1-x)^9. - Bruno Berselli, Aug 31 2011