|
%I #5 Nov 05 2012 16:41:43
%S 0,1,3,5,6,8,9,11,13,14,17,18,19,20,22,23,26,27,28,30,31,33,37,39,40,
%T 43,44,45,47,48,50,55,56,58,59,60,61,62,63,66,67,69,70,73,74,75,77,78,
%U 80,85,86,88,89,90,91,92,93,96,98,99,101,102,103,104,105,106
%N Positions in the infinite trunk of beanstalk (see A179016) where the next node upwards is the larger of the two possible branches.
%H Antti Karttunen, <a href="/A218773/b218773.txt">Table of n, a(n) for n = 1..10000</a>
%e A179016(0) = 0 is the first case where the next term A179016(2) = 1 is the larger of two branches from 0 (the smaller branch in this case being 0 itself, as 0 = 0+A000120(0)), thus the first term of this sequence is 0.
%e A179016(1) = 1 is the second case where the next term A179016(3) = 3 is the larger of two branches from 1 (the smaller branch in this case being 2, as 2 = 1+A000120(2), 2 being a leaf node, one of the terms of A055938), thus the second term of this sequence is 1.
%o (Scheme with Antti Karttunen's Intseq-library): (define A218773 (NONZERO-POS 1 0 (compose-funs A213729 1+)))
%Y Characteristic function: A213729 shifted once left. Complement: A218772. a(n) = A213733(n)-1. First differences: A218775.
%K nonn
%O 1,3
%A _Antti Karttunen_, Nov 05 2012
|
