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!)
A005611 Number of Boolean functions realized by cascades of n gates.
(Formerly M4951)
0

%I M4951 #27 Oct 04 2017 00:48:01

%S 14,254,65534,77575934,103901883134,139822513851134,

%T 188194296960699134,253301985063859899134,340934405511339833019134,

%U 458884164841017463404219134,617639855071600405782329019134,831318706997666563130793785019134

%N Number of Boolean functions realized by cascades of n gates.

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

%H J. T. Butler, <a href="/A005607/a005607.pdf">Fanout-free networks of multivalued gates</a>, Proc. Internat. Symposium Multiple-Valued Logic, Charlotte, NC, 1977, IEEE Press, NY (1977), 39-46. (Annotated scanned copy)

%H J. T. Butler, <a href="/A005607/a005607_1.pdf">Letter to N. J. A. Sloane, Dec. 1978</a>.

%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>

%K nonn

%O 1,1

%A _N. J. A. Sloane_

%E More terms from _Sean A. Irvine_, Jul 13 2016

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 April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)