This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A213725 #19 Jun 03 2025 11:57:46 %S A213725 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, %T A213725 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, %U A213725 1,1,3,0,1,2,0,1,1,1,0,4,1,0,3,1,1,0,2 %N 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. %H A213725 Antti Karttunen, <a href="/A213725/b213725.txt">Table of n, a(n) for n = 0..16384</a> %F A213725 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))), %o A213725 (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))))))) %Y A213725 Differs from A213726 for the first time at n=208, where a(n)=5, while A213726(208)=6. %Y A213725 For all n, a(A179016(n)) = 0, a(A055938(n)) = 1, and a(A213717(n)) >= 2. Cf. A213726, A213727-A213731. %K A213725 nonn,base %O A213725 0,11 %A A213725 _Antti Karttunen_, Nov 01 2012