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.

A322096 Number of permutations of 8 copies of 1..n with no element equal to another within a distance of 1.

Original entry on oeis.org

1, 0, 2, 2403588, 36734931452736, 3470403228952634903280, 1490944857678655357195402606800, 2315418264816304038508896461231618573280, 10937192762438008527903830198163831816546577931520
Offset: 0

Views

Author

Seiichi Manyama, Nov 28 2018

Keywords

Crossrefs

Row 8 of A322093.

Formula

a(n) = n! * A190837(n).
a(n) = Integral_{0..infinity} (Sum_{k=1..8} (-1)^(8-k) * binomial(7, 8-k) * x^k/k!)^n * exp(-x) dx.