cp's OEIS Frontend

A353241 a(0) = 1; for n > 0, a(n) = binary length of (A109812(n) + A109812(n+1)).

%I A353241 #20 Oct 27 2023 19:40:09
%S A353241 1,2,3,3,4,4,4,5,5,4,5,5,5,5,6,6,5,6,6,5,6,6,6,6,6,6,6,6,7,7,6,7,7,6,
%T A353241 7,7,6,7,7,7,7,7,7,6,7,7,7,7,7,8,8,7,8,8,7,8,8,7,8,8,7,7,7,7,7,7,7,7,
%U A353241 7,8,8,7,8,8,8,8,8,8,8,8,7,8,8,8,8,7,8
%N A353241 a(0) = 1; for n > 0, a(n) = binary length of (A109812(n) + A109812(n+1)).
%C A353241 Empirically, k appears 2^(k-2) times for any k >= 2.
%H A353241 N. J. A. Sloane, <a href="/A353241/b353241.txt">Table of n, a(n) for n = 0..20000</a> (first 10000 terms from Rémy Sigrist)
%H A353241 Rémy Sigrist, <a href="/A353241/a353241.txt">C++ program</a>
%e A353241 For n = 7:
%e A353241 - A109812(7) + A109812(8) = 10 + 16 = 26,
%e A353241 - 26 in binary is "11010",
%e A353241 - so a(7) = 5
%o A353241 (C++) See Links section.
%Y A353241 Cf. A109812, A305370, A353240.
%K A353241 nonn,base
%O A353241 0,2
%A A353241 _Rémy Sigrist_, Apr 08 2022