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-1 of 1 results.

A266365 Number of possible plugboard settings for a WWII German Enigma Cipher Machine with n cables.

Original entry on oeis.org

1, 325, 44850, 3453450, 164038875, 5019589575, 100391791500, 1305093289500, 10767019638375, 53835098191875, 150738274937250, 205552193096250, 102776096548125, 7905853580625, 0, 0, 0
Offset: 0

Views

Author

Jonathan Sondow, Dec 28 2015

Keywords

Comments

a(n) increases to a maximum at n = 11, then decreases.

References

  • Andrew Hodges, Alan Turing: the Enigma, Princeton University Press, 2014.

Crossrefs

Cf. A181386.

Programs

  • Mathematica
    Table[26!/((26 - 2 n)! n! 2^n), {n, 0, 16}]

Formula

a(n) = 26! / ((26 - 2n)! n! 2^n) = C(2,26,n) (see A181386).
Showing 1-1 of 1 results.