login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007041 State assignments for n-state machine.
(Formerly M2016)
2

%I M2016 #20 Nov 06 2017 02:41:39

%S 2,12,12,1120,3360,6720,6720,172972800,1210809600,7264857600,

%T 36324288000,145297152000,435891456000,871782912000,871782912000,

%U 1676837160768946176000,25152557411534192640000,352135803761478696960000,4577765448899223060480000

%N State assignments for n-state machine.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%D P. E. Wood, Jr., Switching Theory, McGraw-Hill, 1968, see p. 263.

%H Michael De Vlieger, <a href="/A007041/b007041.txt">Table of n, a(n) for n = 2..410</a>

%H D. Fielder, <a href="/A006845/a006845.pdf">Letters to N. J. A. Sloane (with attachment), 1991</a>

%F a(n) = (2^s)!/((2^s-n)!*s!) where s = ceiling(log_2 n).

%t Array[(2^#2)!/((2^#2 - #1)!*#2!) & @@ {#, Ceiling@ Log2@ #} &, 19, 2] (* _Michael De Vlieger_, Nov 05 2017 *)

%Y Cf. A006845.

%K nonn

%O 2,1

%A _N. J. A. Sloane_

%E More terms and formula corrected by _Sean A. Irvine_, Sep 24 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 17:25 EDT 2024. Contains 371254 sequences. (Running on oeis4.)