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.

A000721 Number of NP-equivalence classes of balanced Boolean functions of n variables.

Original entry on oeis.org

1, 2, 6, 74, 169112, 39785643746726, 37126652766640082937217814348006, 558874591495497577231218517843968898077072559983411918227348931497772
Offset: 1

Views

Author

Keywords

Comments

These are distinct groups of Boolean functions of n variables that output an equal number of 0s and 1s across all possible inputs (balanced), and cannot be transformed into each other by negating or permuting inputs. - Aniruddha Biswas, Nov 12 2024

Examples

			For n = 2 the a(2) = 2. Solutions are f(x,y)=x and f(x,y)=x⊕y; are two 2-variable NP-inequivalent balanced Boolean functions. - _Aniruddha Biswas_, Nov 12 2024
		

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

Formula

a(n) is asymptotic to binomial(2^n, 2^(n-1)) / ( n! * 2^n ) as n -> oo. - Aniruddha Biswas, Dec 16 2024

Extensions

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Aug 21 2010, Sep 05 2010