|
Search: id:A006841
|
|
|
| A006841 |
|
Permutation arrays of period n.
(Formerly M1225)
|
|
+0
7
|
|
| 1, 1, 1, 2, 4, 10, 28, 127, 686, 4975, 42529, 420948, 4622509, 55670332, 726738971, 10217376792, 153848448652, 2470073249960, 42120966152815, 760282326662191, 14481561464994821, 290289454462745374, 6108699653117045614
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
A. P. Street and R. Day, Sequential binary arrays II: Further results on the square grid, pp. 392-418 of Combinatorial Mathematics IX. Proc. Ninth Australian Conference (Brisbane, August 1981). Ed. E. J. Billington, S. Oates-Williams and A. P. Street. Lecture Notes Math., 952. Springer-Verlag, 1982.
|
|
LINKS
|
M. Engelhardt, Java program
|
|
FORMULA
|
Asymptotic behavior: The n-th term T(n) is always larger than n! / (8*n^2) = (n-1)! / 8n; for large n, it is approximated by that value. Stated as formula: T(n) > (n-1)! / 8n; lim 8n * T(n) / (n-1) = 1 as n tends to infinity.
|
|
CROSSREFS
|
Cf. A061417.
Sequence in context: A085549 A022492 A123429 this_sequence A003223 A061417 A060315
Adjacent sequences: A006838 A006839 A006840 this_sequence A006842 A006843 A006844
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Terms for n=1..8 from A. P.Street and R.Day; other terms computed by Matthias Engelhardt (Matthias.R.Engelhardt(AT)web.de). For n=9..12, he used a program which shifts, rotates and mirrors permutations. Terms for n=13..29 computed with a Java program implementing the formulae.
|
|
|
Search completed in 0.002 seconds
|
