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

5, 10, 25, 119, 1173, 44315

Offset: 2

Author

Jonathan Vos Post, Feb 11 2013

Keywords

• more
• nonn

Comments

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

Examples

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

Links

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

Crossrefs

Cf. A003187 and A132183 (similar).