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.

This page as a plain text file.
%I A322096 #23 Nov 29 2018 06:27:30
%S A322096 1,0,2,2403588,36734931452736,3470403228952634903280,
%T A322096 1490944857678655357195402606800,
%U A322096 2315418264816304038508896461231618573280,10937192762438008527903830198163831816546577931520
%N A322096 Number of permutations of 8 copies of 1..n with no element equal to another within a distance of 1.
%H A322096 Seiichi Manyama, <a href="/A322096/b322096.txt">Table of n, a(n) for n = 0..71</a>
%F A322096 a(n) = n! * A190837(n).
%F A322096 a(n) = Integral_{0..infinity} (Sum_{k=1..8} (-1)^(8-k) * binomial(7, 8-k) * x^k/k!)^n * exp(-x) dx.
%Y A322096 Row 8 of A322093.
%Y A322096 Cf. A190837, A322127, A322128.
%K A322096 nonn
%O A322096 0,3
%A A322096 _Seiichi Manyama_, Nov 28 2018