OFFSET
1,3
COMMENTS
Consider the binary trees illustrated in A252753 and A252755: If we start from any n, computing successive iterations of A253554 until 1 is reached (i.e., we are traversing level by level towards the root of the tree, starting from that vertex of the tree where n is located at), a(n) gives the number of odd numbers encountered on the path (i.e., including both the final 1 and the starting n if it was odd).
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..8192
FORMULA
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 12 2015
STATUS
approved