login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #10 Feb 03 2020 02:10:38

%S 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,

%T 28,30,28,30,30,31,32,48,48,56,48,52,56,60,48,52,52,58,56,58,60,62,48,

%U 56,56,60,56,58,60,62,56,60,60,62,60,62,62,63,64,96,96

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

%H Rémy Sigrist, <a href="/A331857/b331857.txt">Table of n, a(n) for n = 0..16384</a>

%H Rémy Sigrist, <a href="/A331857/a331857.gp.txt">PARI program for A331857</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

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

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

%e For n = 6:

%e - the binary representation of 6 is "110",

%e - we can split it in 4 ways:

%e "110" -> "011" -> 3

%e "1" and "10" -> "1" and "01" -> 5

%e "11" and "0" -> "11" and "0" -> 6

%e "1" and "1" and "0" -> "1" and "1" and "0" -> 6

%e - we have 3 distinct values, the greatest being 6,

%e - hence a(6) = 6.

%o (PARI) See Links section.

%Y See A331855 for the number of distinct values, and A331856 for the least value.

%Y Cf. A023416, A023758, A073138.

%K nonn,base

%O 0,3

%A _Rémy Sigrist_, Jan 29 2020