cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 1, 2, 6, 42, 4094, 98210640, 148947659711650464, 872404773126414633407736134582136832, 88627167739308536281147085615274891669779458770791192509009429292662497280
Offset: 0

Views

Author

Keywords

Comments

Number of self-complementary equivalence classes under the group G_n (a permutation group on the domain of Boolean functions, generated by 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).

Crossrefs

Programs

  • Python
    # Using function get_num_equiv_bool_func from A000370.
    [get_num_equiv_bool_func(n,True) for n in range(1,10)] # Gregory Morse, Dec 23 2024

Formula

a(n) = A000370(n) - A317794(n). - Tilman Piesk, Apr 14 2025

Extensions

More terms from Vladeta Jovovic, Feb 23 2000
a(0)=0 from Tilman Piesk, Apr 15 2025