|
%I #15 Nov 24 2018 11:05:02
%S 1,0,1,20824778,7279277647839552,19672658572012343899666292,
%T 293736218147318801678882792470437721,
%U 18739368045280595665934917472507368174737872589,4204427313459831775866154680419213479057724331798640498651
%N Number of permutations of 10 copies of 1..n introduced in order 1..n with no element equal to another within a distance of 1.
%C In general, for r > 1, row r of A322013 is asymptotic to r^(r*n + 1/2) * n^((r-1)*n) / ((r!)^n * exp((r-1)*(n+1))). - _Vaclav Kotesovec_, Nov 24 2018
%H Seiichi Manyama, <a href="/A321670/b321670.txt">Table of n, a(n) for n = 0..63</a>
%F a(n) ~ 2^(2*n + 1/2) * 5^(8*n + 1/2) * n^(9*n) / (567^n * exp(9*(n+1))). - _Vaclav Kotesovec_, Nov 24 2018
%Y Cf. A190826, A190830, A190833, A190835, A190836, A190837, A321669.
%Y Row r=10 of A322013.
%K nonn
%O 0,4
%A _Seiichi Manyama_, Nov 16 2018
| 