|
|
A001320
|
|
Number of self-complementary Boolean functions of n variables: see Comments for precise definition.
(Formerly M2982 N1204)
|
|
1
|
|
|
1, 3, 14, 240, 63488, 4227858432, 18302628885633695744, 338953138925153547590470800371487866880, 115565932813024562229384322928592814283244066726840484812818018414147674308608
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
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
|
|
REFERENCES
|
M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
a:=n->sum(((fermat(n)-1))/2^(j+1), j=0..n): seq(a(n), n=0..8); # Zerinvary Lajos, Oct 24 2006
|
|
MATHEMATICA
|
Table[2^(2^(n-1))(2^n-1)/2^n, {n, 10}] (* Harvey P. Dale, Jul 27 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|