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 A218604 #19 Mar 08 2025 14:57:19 %S A218604 0,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,1,1,2,2,2,0,1,0,0,1,1,2,2,2,1,2,2,3, %T A218604 2,3,3,5,0,1,0,0,1,1,2,2,2,1,2,2,3,2,3,3,5,1,2,2,3,2,2,0,0,0,0,1,3,2, %U A218604 0,1,0,0,1,1,2,2,2,1,2,2,3,2,3,3,5,1,2 %N A218604 a(n) = A173601(n) - A179016(n). %C A218604 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 greater edge of the A086876(n) wide window which it at that point must pass through. %C A218604 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 A218604 Antti Karttunen, <a href="/A218604/b218604.txt">Table of n, a(n) for n = 0..8727</a> %F A218604 a(n) = A086876(n) - A218603(n) - 1. %o A218604 (Scheme) (define (A218604 n) (- (A173601 n) (A179016 n))) %Y A218604 Positions of zeros: A218608, A218606. %Y A218604 Cf. A086876, A173601, A179016, A218603. %K A218604 nonn %O A218604 0,19 %A A218604 _Antti Karttunen_, Nov 03 2012 %E A218604 Offset changed because of the changed offset of A179016 - _Antti Karttunen_, Nov 10 2012