Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A005611 M4951
%S A005611 14,254,65534,77575934,103901883134
%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).
%D A005611 J. T. Butler, ``Fanout-free networks of multivalued gates,'' in Proc. 
               Symposium Multiple-Valued Logic, Charlotte NC, 1977. IEEE Press, 
               NY, 1977, pp. 39-46.
%H A005611 <a href="Sindx_Bo.html#Boolean">Index entries for sequences related to 
               Boolean functions</a>
%Y A005611 Sequence in context: A051622 A113377 A159516 this_sequence A115611 A138560 
               A051690
%Y A005611 Adjacent sequences: A005608 A005609 A005610 this_sequence A005612 A005613 
               A005614
%K A005611 nonn
%O A005611 1,1
%A A005611 N. J. A. Sloane (njas(AT)research.att.com).

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research