login
A253893
a(1) = 0, for n > 1, a(n) = 1 + a(A253889(n)).
4
0, 1, 1, 2, 2, 2, 3, 2, 3, 4, 3, 4, 3, 3, 4, 4, 3, 3, 4, 4, 5, 5, 3, 5, 4, 4, 5, 4, 5, 5, 5, 4, 5, 5, 5, 6, 6, 4, 5, 6, 4, 6, 5, 5, 6, 5, 5, 5, 6, 4, 6, 6, 4, 6, 6, 5, 6, 5, 5, 6, 5, 6, 4, 6, 6, 6, 6, 4, 7, 7, 6, 6, 6, 5, 7, 7, 5, 6, 7, 6, 6, 7, 5, 7, 6, 6, 7, 5, 6, 7, 7, 6, 6, 6, 5, 7, 7, 6, 7, 7, 6, 6, 6, 6, 6, 7, 7, 6, 7, 7, 7, 7, 5, 7, 7, 6, 7, 7, 7, 7, 7, 5
OFFSET
1,4
COMMENTS
When A048673 is represented as a binary tree, then a(n) gives the distance of node containing n from 1 at top.
LINKS
FORMULA
a(1) = 0, for n > 1, a(n) = 1 + A253893(A253889(n)).
a(n) = A000523(A064216(n)).
a(n) = A253894(n) - 1.
Other identities:
a(A007051(n)) = n for all n >= 0.
PROG
(Scheme, with memoization-macro definec)
(definec (A253893 n) (if (= 1 n) 0 (+ 1 (A253893 (A253889 n)))))
CROSSREFS
One less than A253894.
Sequence in context: A286565 A219354 A026903 * A289437 A348369 A068324
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 22 2015
STATUS
approved