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 A218606 #21 Mar 08 2025 14:57:46 %S A218606 1,2,3,5,7,8,10,11,13,15,16,22,24,25,39,41,42,62,63,64,65,69,71,72,92, %T A218606 93,94,95,105,106,107,108,114,123,125,126,146,147,148,149,159,160,161, %U A218606 162,168,183,184,185,186,192,203,221,223,224,244,245,246,247,257 %N A218606 a(n) = A218608(n-1) + 1. %C A218606 These are the points i for which the predecessor node (i.e. the vertex that is one step towards the root) 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. (See comments at A218604.) %H A218606 Antti Karttunen, <a href="/A218606/b218606.txt">Table of n, a(n) for n = 1..17447</a> %F A218606 a(n) = A218608(n-1) + 1. %o A218606 (Scheme) (define (A218606 n) (1+ (A218608 (-1+ n)))) %Y A218606 Cf. A218604, A218605, A218608. %K A218606 nonn %O A218606 1,2 %A A218606 _Antti Karttunen_, Nov 03 2012 %E A218606 Definition changed because of the changed offset of A218604. - _Antti Karttunen_, Nov 10 2012