A344339 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A344339

a(n) is the minimal number of terms of A332520 that need to be combined with the bitwise OR operator in order to give n.

0, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 3, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 1, 2, 2, 1, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 3, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 2, 1, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,7

COMMENTS

This sequence is related to Karnaugh maps:

- for any number n with up to 2^k binary digits (possibly with leading zeros),

- we can interpret the binary expansion of n as a truth table for a k-ary Boolean function f,

- a(n) gives the optimal number of products in a disjunctive normal form for f.

LINKS

Table of n, a(n) for n=0..86.

Rémy Sigrist, PARI program for A344339

Wikipedia, Disjunctive normal form