This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263254 If A262693(n) = 1, then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)). 11
 0, 1, 0, 2, 2, 3, 0, 4, 3, 1, 1, 2, 0, 3, 2, 3, 3, 4, 0, 5, 3, 5, 0, 6, 4, 1, 1, 7, 1, 8, 0, 9, 2, 9, 0, 10, 8, 11, 1, 11, 3, 12, 0, 13, 2, 12, 0, 13, 2, 1, 3, 14, 1, 15, 0, 15, 3, 16, 0, 17, 3, 18, 0, 17, 17, 19, 1, 20, 1, 20, 0, 21, 4, 22, 1, 21, 1, 23, 0, 24, 1, 2, 1, 3, 5, 3, 2, 4, 2, 5, 0, 5, 3, 6, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Distance of node n from the infinite trunk (A259934) of the tree defined by edge-relation A049820(child) = parent. Zero-based row index to array A263255. LINKS Antti Karttunen, Table of n, a(n) for n = 0..10002 FORMULA If A262693(n) = 1 [when n is in A259934], then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)). a(n) = A155043(n) - A262904(n). a(n) = A263275(n) - 1. PROG (Scheme, two alternative implementations) (definec (A263254 n) (if (= 1 (A262693 n)) 0 (+ 1 (A263254 (A049820 n))))) (define (A263254 n) (- (A155043 n) (A262904 n))) CROSSREFS One less than A263275. Cf. A263257 (positions of records, where each n first occurs). Cf. A000005, A049820, A155043, A259934, A262693, A262695, A262904, A263255, A263274. Sequence in context: A197118 A035143 A035173 * A257989 A095201 A272143 Adjacent sequences:  A263251 A263252 A263253 * A263255 A263256 A263257 KEYWORD nonn AUTHOR Antti Karttunen, Nov 07 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 January 22 17:33 EST 2019. Contains 319365 sequences. (Running on oeis4.)