1,1

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

R. L. Ashenhurst, The application of counting techniques, Proc. ACM Nat. Mtg., Pittsburg, 1952, 293-305.

M. A. Harrison, The number of transitivity sets of Boolean functions, J. Soc. Indust. Appl. Math., 11 (1963), 806-828.

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

Index entries for sequences related to Boolean functions

a(n)=(2^(2^n)+(2^n-1)*2^(2^(n-1)))/2^n.

Cf. A051502.

Sequence in context: A041349 A041016 A003758 this_sequence A132565 A129518 A007670

Adjacent sequences: A000228 A000229 A000230 this_sequence A000232 A000233 A000234

easy,nonn,nice

N. J. A. Sloane (njas(AT)research.att.com).

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 20 2000