# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a005611
Showing 1-1 of 1

%I A005611 M4951 #27 Oct 04 2017 00:48:01
%S A005611 14,254,65534,77575934,103901883134,139822513851134,
%T A005611 188194296960699134,253301985063859899134,340934405511339833019134,
%U A005611 458884164841017463404219134,617639855071600405782329019134,831318706997666563130793785019134
%N A005611 Number of Boolean functions realized by cascades of n gates.
%D A005611 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005611 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 A005611 J. T. Butler, <a href="/A005607/a005607_1.pdf">Letter to N. J. A. Sloane, Dec. 1978</a>.
%H A005611 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%K A005611 nonn
%O A005611 1,1
%A A005611 _N. J. A. Sloane_
%E A005611 More terms from _Sean A. Irvine_, Jul 13 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE