A331857 - 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

A331857

a(n) is the greatest value obtained by partitioning the binary representation of n into consecutive blocks, and then reversing those blocks.

0, 1, 2, 3, 4, 6, 6, 7, 8, 12, 12, 14, 12, 14, 14, 15, 16, 24, 24, 28, 24, 26, 28, 30, 24, 28, 28, 30, 28, 30, 30, 31, 32, 48, 48, 56, 48, 52, 56, 60, 48, 52, 52, 58, 56, 58, 60, 62, 48, 56, 56, 60, 56, 58, 60, 62, 56, 60, 60, 62, 60, 62, 62, 63, 64, 96, 96

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

OFFSET

0,3

LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..16384

Rémy Sigrist, PARI program for A331857

Index entries for sequences related to binary expansion of n

FORMULA

a(n)^A023416(n) = A073138(n) (where a^k denotes the k-th iterate of n).

a(n) >= n with equality iff n belongs to A023758.

EXAMPLE

For n = 6: