A205593 a(2) = 0, a(3k) = a(3k+1) = a(2k), a(3k+2) = a(2k+1) + 1 for k >= 1.

0, 0, 0, 1, 0, 0, 2, 0, 0, 1, 2, 2, 1, 0, 0, 2, 2, 2, 3, 1, 1, 1, 0, 0, 3, 2, 2, 3, 3, 3, 2, 1, 1, 2, 0, 0, 1, 3, 3, 3, 2, 2, 4, 3, 3, 4, 2, 2, 2, 1, 1, 3, 0, 0, 1, 1, 1, 4, 3, 3, 4, 2, 2, 3, 4, 4, 4, 3, 3, 5, 2, 2, 3, 2, 2, 2, 1, 1, 4, 0, 0, 1, 1, 1, 2, 1, 1, 5

Offset: 2

Author

Joseph Myers, Jan 29 2012

Keywords

• easy
• nonn

Links

• Joseph Myers, Table of n, a(n) for n = 2..1000
• 2011/12 British Mathematical Olympiad Round 2, Problem 2.

Crossrefs

Cf. A205591, A205592, A205594, A205595, A205596.

Formula

a(n) = log_2(A205592(n)).