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

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, 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, 7, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 7, 8, 8, 8, 8, 7, 8

Offset: 0

Author

Rémy Sigrist, Apr 08 2022

Keywords

• nonn
• base

Comments

Empirically, k appears 2^(k-2) times for any k >= 2.

Examples

			For n = 7:
- A109812(7) + A109812(8) = 10 + 16 = 26,
- 26 in binary is "11010",
- so a(7) = 5
		

Links

• N. J. A. Sloane, Table of n, a(n) for n = 0..20000 (first 10000 terms from Rémy Sigrist)
• Rémy Sigrist, C++ program

Crossrefs

Cf. A109812, A305370, A353240.