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 A213732 #17 Nov 05 2012 16:43:13 %S A213732 3,5,8,11,13,16,17,22,25,26,30,33,35,36,37,39,42,43,47,50,52,53,54,55, %T A213732 58,65,66,69,72,73,77,80,82,83,84,85,88,95,96,98,101,108,109,110,114, %U A213732 115,116,117,118,121,123,126,127,131,134,136,137,138,139,142,149 %N A213732 Positions of even numbers greater than zero in A179016. %C A213732 These are exactly those positions in the infinite trunk of beanstalk (see A179016 and A213729) where the node is the smaller of the two possible branches from one node below. %H A213732 Antti Karttunen, <a href="/A213732/b213732.txt">Table of n, a(n) for n = 1..10000</a> %F A213732 a(n) = A218772(n)+1. %e A213732 A179016(3) = 4 is the first case where the infinite trunk has continued to the smaller of two branches of the predecessor node. (In this case the predecessor node is A179016(2)=3, for which hold both 3+A000120(4)=3+1=4 (the smaller branch) and 3+A000120(5)=3+2=5 (the larger branch). Thus the first term of this sequence is 3. %e A213732 A179016(5) = 8 is the second case where the infinite trunk has continued to the smaller of two branches of the predecessor node (In this case the predecessor node is A179016(4)=7, for which hold both 7+A000120(8)=7+1=8 (the smaller branch) and 7+A000120(9)=7+2=9 (the larger branch). Thus the second term of this sequence is 5. %o A213732 (Scheme): (define (A213732 n) (1+ (A218772 n))) %Y A213732 Complement of A213733. First differences: A218774. %K A213732 nonn %O A213732 1,1 %A A213732 _Antti Karttunen_, Nov 01 2012 %E A213732 Description changed because of the changed starting offset of A179016. - _Antti Karttunen_, Nov 05 2012