A083742 First differences of A006282.

0, 1, 2, 2, 4, 3, 4, 3, 7, 5, 6, 4, 7, 5, 6, 4, 11, 8, 9, 6, 10, 7, 8, 5, 11, 8, 9, 6, 10, 7, 8, 5, 16, 12, 13, 9, 14, 10, 11, 7, 15, 11, 12, 8, 13, 9, 10, 6, 16, 12, 13, 9, 14, 10, 11, 7, 15, 11, 12, 8, 13, 9, 10, 6, 22, 17, 18, 13, 19, 14, 15, 10, 20, 15, 16, 11, 17

Offset: 0

Author

Ralf Stephan, May 05 2003

Keywords

• nonn
• easy

References

• D. E. Knuth, Art of Computer Programming, Sorting and Searching, Addison-Wesley, 1973, Section 5.2.2, ex. 14,15.

Links

• J.-P. Allouche and J. Shallit, The ring of k-regular sequences, Theoretical Computer Sci., 98 (1992), 163-197, ex. 29.

Formula

a(0)=0, a(2n)=a(n)+floor(log_2(2n)), a(2n+1)=a(n)+1.