A109003 - OEIS

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.

%I #7 Sep 07 2013 11:30:49

%S 1,2,5,39,22442

%N 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.

%H L. E. Danielsen, <a href="http://www.ii.uib.no/~larsed/boolean/">Database of Boolean functions</a>

%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>

%Y See A001289 for further information.

%K nonn,more

%O 1,2

%A _N. J. A. Sloane_, Aug 16 2005