login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A000610
Number of self-complementary Boolean functions of n variables: see Comments for precise definition.
(Formerly M1714 N0678)
5
1, 2, 6, 42, 4094, 98210640, 148947659711650464, 872404773126414633407736134582136832, 88627167739308536281147085615274891669779458770791192509009429292662497280
OFFSET
1,2
COMMENTS
Number of self-complementary equivalence classes under the group G_n (a permutation group on the domain of Boolean functions, containing the symmetric group S_n and the group C_{2^n} of all 2^n complementations of variables). - R. J. Mathar, Apr 14 2010
REFERENCES
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
B. Elspas, Self-complementary symmetry types of Boolean functions, IEEE Transactions on Electronic Computers 2, no. EC-9 (1960): 264-266. [Annotated scanned copy]
M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561.
M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561. [Annotated scanned copy]
E. M. Palmer and R. W. Robinson, Enumeration of self-dual configurations Pacific J. Math., 110 (1984), 203-221.
I. Toda, On the number of types of self-dual logical functions, IEEE Trans. Electron. Comput., 11 (1962), 282-284.
CROSSREFS
Cf. A001320.
Sequence in context: A007018 A100016 A344562 * A023363 A091241 A198076
KEYWORD
nonn,nice,easy
EXTENSIONS
More terms from Vladeta Jovovic, Feb 23 2000
STATUS
approved