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 A218772 #11 Nov 01 2024 05:10:53 %S A218772 2,4,7,10,12,15,16,21,24,25,29,32,34,35,36,38,41,42,46,49,51,52,53,54, %T A218772 57,64,65,68,71,72,76,79,81,82,83,84,87,94,95,97,100,107,108,109,113, %U A218772 114,115,116,117,120,122,125,126,130,133,135,136,137,138,141,148 %N A218772 Positions in the infinite trunk of beanstalk (see A179016) where the next node upwards is the smaller of the two possible branches. %H A218772 Antti Karttunen, <a href="/A218772/b218772.txt">Table of n, a(n) for n = 1..10000</a> %e A218772 A179016(2) = 3 is the first case where the next term A179016(3) = 4 is the smaller of two branches from 3 (the larger is 5, as 5 = 3+A000120(5)), thus the first term of this sequence is 2. %e A218772 The next case occurs at A179016(4) = 7, as the next term here is again 8, the smaller of two branches from 7 (the larger being 9, as 9 = 7+A000120(9)), thus the second term of this sequence is 4. %o A218772 (Scheme with _Antti Karttunen_'s Intseq-library): (define A218772 (NONZERO-POS 1 0 (compose-funs A213728 1+))) %Y A218772 Characteristic function: A213728 shifted once left. Complement: A218773. a(n) = A213732(n)-1. First differences: A218774. %K A218772 nonn %O A218772 1,1 %A A218772 _Antti Karttunen_, Nov 05 2012