The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213725 a(n)=0 if n is in the infinite trunk of Carl White's beanstalk (i.e., in A179016), otherwise 1 + number of steps to reach the farthest leaf in that finite branch of the beanstalk. 13
 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 0, 1, 1, 1, 0, 0, 1, 2, 0, 1, 1, 3, 0, 1, 2, 0, 1, 1, 1, 1, 0, 0, 1, 2, 0, 1, 1, 3, 0, 1, 2, 0, 1, 1, 1, 0, 4, 1, 0, 3, 1, 1, 0, 2, 1, 2, 0, 1, 1, 1, 1, 1, 0, 0, 1, 2, 0, 1, 1, 3, 0, 1, 2, 0, 1, 1, 1, 0, 4, 1, 0, 3, 1, 1, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 LINKS Antti Karttunen, Table of n, a(n) for n = 0..16384 FORMULA If A079559(n)=0, a(n)=1; otherwise, if A213719(n)=1, a(n)=0; otherwise a(n) = 1+max(a(A213723(n)), a(A213724(n))), PROG (Scheme with memoization-macro definec): (definec (A213725 n) (cond ((zero? (A079559 n)) 1) ((not (zero? (A213719 n))) 0) (else (1+ (max (A213725 (A213723 n)) (A213725 (A213724 n))))))) CROSSREFS Differs from A213726 for the first time at n=208, where a(n)=5, while A213726(208)=6. For all n, a(A179016(n)) = 0, a(A055938(n)) = 1, and a(A213717(n)) >= 2. Cf. A213726, A213727-A213731. Sequence in context: A133008 A102550 A293139 * A213726 A116929 A059984 Adjacent sequences:  A213722 A213723 A213724 * A213726 A213727 A213728 KEYWORD nonn AUTHOR Antti Karttunen, Nov 01 2012 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 August 1 06:45 EDT 2021. Contains 346384 sequences. (Running on oeis4.)