0,3

Equivalence classes of invertible maps from {0,1}^n to {0,1}^n, under action of (C_2)^n on both domain and range.

M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 154, problem 12.

C. S. Lorens, Invertible Boolean functions, IEEE Trans. Electron. Computers, EC-13 (1964), 529-541.

Index entries for sequences related to Boolean functions

A000652: n->2^(-2*n)*( (2^n)! + (2^n-1)^2 * ( (2^(n-1))! )*2^(2^(n-1)));

Cf. A001038 A000653 A000654 A000722 A001537 A046856 A046857

Adjacent sequences: A000649 A000650 A000651 this_sequence A000653 A000654 A000655

Sequence in context: A064430 A137801 A076667 this_sequence A024085 A080474 A079190

nonn,easy

njas

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 23 2000