OFFSET
0,2
COMMENTS
a(n) increases to a maximum at n = 11, then decreases.
REFERENCES
Andrew Hodges, Alan Turing: the Enigma, Princeton University Press, 2014.
LINKS
A. Ray Miller, The Cryptographic Mathematics of Enigma, Cryptologia, 19 (1995), 65-80.
Kalika Prasad and Munesh Kumari, A review on mathematical strength and analysis of Enigma, arXiv:2004.09982 [cs.CR], 2020.
Tony Sale, Counting the Possible Plugboard Setting, Codes and Ciphers, Enigma.
FORMULA
a(n) = 26! / ((26 - 2n)! n! 2^n) = C(2,26,n) (see A181386).
MATHEMATICA
Table[26!/((26 - 2 n)! n! 2^n), {n, 0, 16}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Sondow, Dec 28 2015
STATUS
approved