A331853 - OEIS

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

A331853

a(n) is the number of distinct values obtained by partitioning the binary representation of n into consecutive blocks, and then applying the bitwise AND operator to the numbers represented by the blocks.

1, 1, 2, 2, 2, 3, 2, 2, 2, 3, 3, 4, 2, 3, 3, 3, 2, 3, 3, 4, 2, 3, 3, 4, 2, 3, 3, 5, 2, 3, 3, 3, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 6, 2, 3, 3, 5, 3, 4, 4, 5, 2, 3, 3, 5, 3, 4, 4, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 6, 2, 3, 3, 4, 3, 4, 4

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

OFFSET

0,3

LINKS

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

Rémy Sigrist, PARI program for A331853

Index entries for sequences related to binary expansion of n

FORMULA

a(2^k) = 2 for any k > 0.

a(2^k-1) = A008619(k+1) for any k >= 0.

EXAMPLE

For n = 6: