login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299104 Number of SNPN-equivalence classes of Boolean functions of n or fewer variables. 1
2, 5, 26, 1072, 9340584, 6406603624626816, 16879085743296494006611933604867584, 717956902513121252476003434439730271412009640241362775196201481717907456 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Number of Boolean functions distinct under simultaneous complementation of the inputs and/or permutation of the inputs, complementation of the output. Algorithm includes elements that are conjectural in nature. Documentation of the algorithm is at web link.

REFERENCES

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973.

LINKS

Marko Riedel, Table of n, a(n) for n = 1..16

Marko Riedel et al., Number of boolean functions

Marko Riedel, Maple code for sequence including all cycle indices for Power Group Enumeration, computed from first principles and by enumeration.

CROSSREFS

Cf. A000370, A003180.

Sequence in context: A003095 A023362 A138613 * A090744 A041571 A042259

Adjacent sequences:  A299101 A299102 A299103 * A299105 A299106 A299107

KEYWORD

nonn

AUTHOR

Marko Riedel, Feb 15 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 12:30 EDT 2019. Contains 323568 sequences. (Running on oeis4.)