A211865 Arises in computing maximum information a Boolean function can reveal about noisy inputs.

5, 10, 25, 119, 1173, 44315

Offset

2,1

Comments

From Table I: Reduction in number of candidate Boolean functions to be considered for verification of Conjecture 2, Kumar.

Links

Table of n, a(n) for n=2..7.

Gowtham R. Kumar, Thomas A. Courtade, Which Boolean Functions are Most Informative?, Feb 11, 2013, arXiv:1302.2512 [cs.IT].

Example

a(4) = 25 because only 25 Boolean functions need to be examined for the conjecture, from 65536 on 4 variables.

Crossrefs

Cf. A003187 and A132183 (similar).

Sequence in context: A106729 A212950 A038252 * A083010 A324005 A166388

Adjacent sequences: A211862 A211863 A211864 * A211866 A211867 A211868

Keyword

more,nonn

Author

Jonathan Vos Post, Feb 11 2013

Status

approved