A001320 - OEIS

%I M2982 N1204 #26 Aug 06 2017 22:17:48

%S 1,3,14,240,63488,4227858432,18302628885633695744,

%T 338953138925153547590470800371487866880,

%U 115565932813024562229384322928592814283244066726840484812818018414147674308608

%N Number of self-complementary Boolean functions of n variables: see Comments for precise definition.

%C Number of self-complementary equivalence classes under the group C_{2^n} of all 2^n complementations of variables. - _R. J. Mathar_, Apr 14 2010

%C The next term (a(10)) has 155 digits. - _Harvey P. Dale_, Jul 27 2011

%D M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%H M. A. Harrison, <a href="/A000370/a000370.pdf">The number of equivalence classes of Boolean functions under groups containing negation</a>, IEEE Trans. Electron. Comput. 12 (1963), 559-561. [Annotated scanned copy]

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

%F a(n) = 2^(2^(n-1)) * (2^n-1) / 2^n. - _Zerinvary Lajos_, Oct 24 2006, corrected by _R. J. Mathar_, Apr 14 2010

%F a(n) = A016031(n)*A000079(n-1). - _R. J. Mathar_, Apr 14 2010

%p a:=n->sum(((fermat(n)-1))/2^(j+1),j=0..n): seq(a(n), n=0..8); # _Zerinvary Lajos_, Oct 24 2006

%t Table[2^(2^(n-1))(2^n-1)/2^n,{n,10}] (* _Harvey P. Dale_, Jul 27 2011 *)

%Y Cf. A000610.

%K nonn,easy,nice

%O 1,2

%A _N. J. A. Sloane_

%E More terms from _Vladeta Jovovic_, Feb 23 2000