Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Nov 09 2015 16:07:11
%S 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,
%T 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,
%U 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
%N If A262693(n) = 1, then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)).
%C Distance of node n from the infinite trunk (A259934) of the tree defined by edge-relation A049820(child) = parent.
%C Zero-based row index to array A263255.
%H Antti Karttunen, <a href="/A263254/b263254.txt">Table of n, a(n) for n = 0..10002</a>
%F If A262693(n) = 1 [when n is in A259934], then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)).
%F a(n) = A155043(n) - A262904(n).
%F a(n) = A263275(n) - 1.
%o (Scheme, two alternative implementations)
%o (definec (A263254 n) (if (= 1 (A262693 n)) 0 (+ 1 (A263254 (A049820 n)))))
%o (define (A263254 n) (- (A155043 n) (A262904 n)))
%Y One less than A263275.
%Y Cf. A263257 (positions of records, where each n first occurs).
%Y Cf. A000005, A049820, A155043, A259934, A262693, A262695, A262904, A263255, A263274.
%K nonn
%O 0,4
%A _Antti Karttunen_, Nov 07 2015