This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321670 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. 4
 1, 0, 1, 20824778, 7279277647839552, 19672658572012343899666292, 293736218147318801678882792470437721, 18739368045280595665934917472507368174737872589, 4204427313459831775866154680419213479057724331798640498651 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS 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 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..63 FORMULA 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 CROSSREFS Cf. A190826, A190830, A190833, A190835, A190836, A190837, A321669. Row r=10 of A322013. Sequence in context: A116497 A133543 A294031 * A254497 A254490 A253862 Adjacent sequences:  A321667 A321668 A321669 * A321671 A321672 A321673 KEYWORD nonn AUTHOR Seiichi Manyama, Nov 16 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 18 21:25 EDT 2019. Contains 325144 sequences. (Running on oeis4.)