%I A000231 M2702 N1083
%S A000231 3,7,46,4336,134281216,288230380379570176,
%T A000231 2658455991569831764110243006194384896,
%U A000231 452312848583266388373324160190187140390789016525312000869601987902398529536
%N A000231 Number of inequivalent Boolean functions of n variables under action 
               of complementing group.
%D A000231 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A000231 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A000231 R. L. Ashenhurst, The application of counting techniques, Proc. ACM Nat. 
               Mtg., Pittsburg, 1952, 293-305.
%D A000231 M. A. Harrison, The number of transitivity sets of Boolean functions, 
               J. Soc. Indust. Appl. Math., 11 (1963), 806-828.
%D A000231 M. A. Harrison, Introduction to Switching and Automata Theory. McGraw 
               Hill, NY, 1965, p. 143.
%H A000231 <a href="Sindx_Bo.html#Boolean">Index entries for sequences related to 
               Boolean functions</a>
%F A000231 a(n)=(2^(2^n)+(2^n-1)*2^(2^(n-1)))/2^n.
%Y A000231 Cf. A051502.
%Y A000231 Sequence in context: A041349 A041016 A003758 this_sequence A132565 A129518 
               A007670
%Y A000231 Adjacent sequences: A000228 A000229 A000230 this_sequence A000232 A000233 
               A000234
%K A000231 easy,nonn,nice
%O A000231 1,1
%A A000231 N. J. A. Sloane (njas(AT)research.att.com).
%E A000231 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 20 2000