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 A218607 #9 Jul 16 2017 20:07:48 %S A218607 0,1,3,5,8,13,22,33,35,36,37,39,50,52,53,54,55,58,69,80,82,83,84,85, %T A218607 88,101,118,123,134,136,137,138,139,142,155,172,179,196,207,212,221, %U A218607 232,234,235,236,237,240,253,270,277,294,305,310,321,338,349,354,369,374,383,400 %N A218607 The positions of zeros in A218603, i.e., those integers i for which A179016(i) = A213708(i). %C A218607 These are the points i for which the corresponding node in the infinite trunk of beanstalk (A179016(i)) is at the least possible position of its allotted "window" which it at that point must pass through, i.e., there are no leaves or side-trees at its left (lesser) side at these points. (See comments at A218603.) %H A218607 Antti Karttunen, <a href="/A218607/b218607.txt">Table of n, a(n) for n = 0..7948</a> %o A218607 (Scheme with Antti Karttunen's intseq-library): (define A218607 (ZERO-POS 0 0 A218603)) %Y A218607 Apart from first two terms, a subset of A213732. Cf. A218608, A218605. %K A218607 nonn %O A218607 0,3 %A A218607 _Antti Karttunen_, Nov 10 2012