A109003 Number of equivalence classes of Boolean functions, that is, maps from GF(2)^n to GF(2), where maps f and g are equivalent iff one can be obtained from the other by a combination of (i) permuting the variables, (ii) complementing the variables, (iii) mapping f(x) to f(x) + b.x + c for a binary vector b and a binary scalar c.

1, 2, 5, 39, 22442

Offset

1,2

Links

Table of n, a(n) for n=1..5.

L. E. Danielsen, Database of Boolean functions

Index entries for sequences related to Boolean functions

Crossrefs

See A001289 for further information.

Sequence in context: A357822 A183255 A307141 * A120031 A110066 A155176

Adjacent sequences: A109000 A109001 A109002 * A109004 A109005 A109006

Keyword

nonn,more

Author

N. J. A. Sloane, Aug 16 2005

Status

approved