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.

Showing 1-2 of 2 results.

A003111 Number of complete mappings of the cyclic group Z_{2n+1}.

Original entry on oeis.org

1, 1, 3, 19, 225, 3441, 79259, 2424195, 94471089, 4613520889, 275148653115, 19686730313955, 1664382756757625
Offset: 0

Views

Author

Keywords

Comments

A complete mapping of a cyclic group (Z_n,+) is a permutation f(x) of Z_n such that f(0)=0 and such that f(x)-x is also a permutation.
a(n)=TSQ(n)/n where TSQ(n) is the number of solutions of the toroidal semi-n-queen problem (A006717 is the sequence TSQ(2k-1)).
Stated another way, this is the number of "good" permutations on 2n+1 elements (see A006717) that start with 0. [Novakovich]. - N. J. A. Sloane, Feb 22 2011

Examples

			f(x)=2x in (Z_7,+) is a complete mapping of Z_7 since f(0)=0 and f(x)-x (=x) is also a permutation of Z_7.
		

References

  • Anthony B. Evans, Orthomorphism Graphs of Groups, vol. 1535 of Lecture Notes in Mathematics, Springer-Verlag, 1991.
  • Y. P. Shieh, Partition strategies for #P-complete problems with applications to enumerative combinatorics, PhD thesis, National Taiwan University, 2001.
  • Y. P. Shieh, J. Hsiang and D. F. Hsu, On the enumeration of Abelian k-complete mappings, Vol. 144 of Congressus Numerantium, 2000, pp. 67-88.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Formula

Suppose n is odd and let b(n)=a((n-1)/2). Then b(n) is odd; if n>3 and n is not 1 mod 3 then b(n) is divisible by 3; b(n)=-2 mod n in n is prime; b(n) is divisible by n if n is composite; b(n) is asymptotically in between 3.2^n and 0.62^n n!. [Cavenagh, Wanless], [McKay, McLeod, Wanless], [Stones, Wanless]. - Ian Wanless, Jul 30 2010
a(n) = A003109(n) + A003110(n). - Sean A. Irvine, Jan 30 2015
a(n) = A006609(2*n+2), n>0. - Sean A. Irvine, Jan 30 2015
From Vaclav Kotesovec, Jul 22 2023: (Start)
a(n) ~ exp(-1/2) * (2*n)!^2 / (2*n + 1)^(2*n - 1). [Eberhard, Manners, Mrazovic, 2016, Theorem 1.3, n->2*n+1]
a(n) ~ Pi * 2^(2*n + 3) * n^(2*n + 2) / exp(4*n + 3/2). (End)

Extensions

More terms from J. Hsiang, D. F. Hsu and Y. P. Shieh (arping(AT)turing.csie.ntu.edu.tw), Jun 03 2002
a(12) from Yuh-Pyng Shieh (arping(AT)gmail.com), Jan 10 2006

A006204 Number of starters in cyclic group of order 2n+1.

Original entry on oeis.org

1, 1, 3, 9, 25, 133, 631, 3857, 25905, 188181, 1515283, 13376125, 128102625, 1317606101, 14534145947, 170922533545, 2138089212789
Offset: 1

Views

Author

Keywords

Comments

A complete mapping of a cyclic group (Z_m,+) is a permutation f(x) of Z_m with f(0)=0 such that f(x)-x is also a permutation. a(n) is the number of complete mappings f(x) of the cyclic group Z_{2n+1} such that f^(-1)=f.
In other words, a(n) is the number of complete mappings fixed under the reflection operator R, where R(f)=f^(-1). Reflection R is not only a symmetry operator of complete mappings, but also one of the (Toroidal)-(semi) N-Queen problems and of the strong complete mappings problem.

Examples

			f(x)=6x in (Z_7,+) is a complete mapping of Z_7 since f(0)=0 and f(x)-x (=5x) is also a permutation of Z_7. f^(-1)(x)=6x=f(x). So f(x) is fixed under reflection.
		

References

  • CRC Handbook of Combinatorial Designs, 1996, p. 469.
  • CRC Handbook of Combinatorial Designs, 2nd edition, 2007, p. 624.
  • J. D. Horton, Orthogonal starters in finite Abelian groups, Discrete Math., 79 (1989/1990), 265-278.
  • V. Linja-aho and Patric R. J. Östergård, Classification of starters, J. Combin. Math. Combin. Comput. 75 (2010), 153-159.
  • Y. P. Shieh, "Partition strategies for #P-complete problems with applications to enumerative combinatorics", PhD thesis, National Taiwan University, 2001.
  • Y. P. Shieh, J. Hsiang and D. F. Hsu, "On the enumeration of Abelian k-complete mappings", vol. 144 of Congressus Numerantium, 2000, pp. 67-88.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

Additional comments and one more term from J. Hsiang, D. F. Hsu and Y. P. Shieh (arping(AT)turing.csie.ntu.edu.tw), Jun 03 2002
Corrected and extended by Roland Bacher, Dec 18 2007
Extended by Vesa Linja-aho (vesa.linja-aho(AT)tkk.fi), May 06 2009
Showing 1-2 of 2 results.