A007041 State assignments for n-state machine.
2, 12, 12, 1120, 3360, 6720, 6720, 172972800, 1210809600, 7264857600, 36324288000, 145297152000, 435891456000, 871782912000, 871782912000, 1676837160768946176000, 25152557411534192640000, 352135803761478696960000, 4577765448899223060480000
Offset: 2
Keywords
References
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
- P. E. Wood, Jr., Switching Theory, McGraw-Hill, 1968, see p. 263.
Links
- Michael De Vlieger, Table of n, a(n) for n = 2..410
- D. Fielder, Letters to N. J. A. Sloane (with attachment), 1991
Crossrefs
Cf. A006845.
Programs
-
Mathematica
Array[(2^#2)!/((2^#2 - #1)!*#2!) & @@ {#, Ceiling@ Log2@ #} &, 19, 2] (* Michael De Vlieger, Nov 05 2017 *)
Formula
a(n) = (2^s)!/((2^s-n)!*s!) where s = ceiling(log_2 n).
Extensions
More terms and formula corrected by Sean A. Irvine, Sep 24 2017