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 A218603 #18 Mar 08 2025 14:57:14 %S A218603 0,0,1,0,1,0,1,3,0,1,3,2,3,0,1,3,2,2,1,1,1,3,0,1,3,2,2,1,1,1,2,1,1,0, %T A218603 1,0,0,0,1,0,1,3,2,2,1,1,1,2,1,1,0,1,0,0,0,0,1,1,0,1,1,3,5,3,5,4,2,3, %U A218603 5,0,1,3,2,2,1,1,1,2,1,1,0,1,0,0,0,0,1 %N A218603 a(n) = A179016(n) - A213708(n). %C A218603 For all n, the following holds: A213708(n) <= A179016(n) <= A173601(n). This sequence gives the distance of the node n in the infinite trunk of beanstalk (A179016(n)) from the lesser edge of the A086876(n) wide window which it at that point must pass through. %C A218603 The increasing steps seem to be quite constrained in their magnitude, compared to the decreasing steps. (This depends on how the "tendrils", i.e. the finite side-trees on the other side of the infinite trunk grow and reach their tops). %H A218603 Antti Karttunen, <a href="/A218603/b218603.txt">Table of n, a(n) for n = 0..8727</a> %F A218603 a(n) = A086876(n) - A218604(n) - 1. %o A218603 (Scheme) (define (A218603 n) (- (A179016 n) (A213708 n))) %Y A218603 Positions of zeros: A218607, A218605. %Y A218603 Cf. A086876, A179016, A213708, A218604. %K A218603 nonn %O A218603 0,8 %A A218603 _Antti Karttunen_, Nov 03 2012 %E A218603 Offset changed because of the changed offset of A179016 - _Antti Karttunen_, Nov 10 2012