This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 Antti Karttunen, Table of n, a(n) for n = 1..8192 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. Cf. A000523, A007051, A064216, A253786, A253887, A253889. Sequence in context: A286565 A219354 A026903 * A289437 A068324 A167505 Adjacent sequences:  A253890 A253891 A253892 * A253894 A253895 A253896 KEYWORD nonn AUTHOR Antti Karttunen, Jan 22 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 15:50 EDT 2019. Contains 328223 sequences. (Running on oeis4.)