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 A218608 #11 Jul 16 2017 20:07:21 %S A218608 0,1,2,4,6,7,9,10,12,14,15,21,23,24,38,40,41,61,62,63,64,68,70,71,91, %T A218608 92,93,94,104,105,106,107,113,122,124,125,145,146,147,148,158,159,160, %U A218608 161,167,182,183,184,185,191,202,220,222,223,243,244,245,246,256 %N A218608 The positions of zeros in A218604, i.e., those integers i for which A179016(i) = A173601(i). %C A218608 These are the points i for which the corresponding node in the infinite trunk of beanstalk (A179016(i)) is at the greatest possible position of the allotted "window" which it at that point must pass through, i.e. there are no leaves or side-trees at its right (greater) side at these points. (See comments at A218604.) %H A218608 Antti Karttunen, <a href="/A218608/b218608.txt">Table of n, a(n) for n = 0..7730</a> %o A218608 (Scheme with Antti Karttunen's intseq-library): (define A218608 (ZERO-POS 0 0 A218604)) %Y A218608 Apart from zero, a subset of A213733. Cf. A218607, A218606. %K A218608 nonn %O A218608 0,3 %A A218608 _Antti Karttunen_, Nov 10 2012