%I #15 Nov 10 2012 14:16:09
%S 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 93,94,95,105,106,107,108,114,123,125,126,146,147,148,149,159,160,161,
%U 162,168,183,184,185,186,192,203,221,223,224,244,245,246,247,257
%N a(n) = A218608(n-1)+1.
%C 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 Antti Karttunen, <a href="/A218606/b218606.txt">Table of n, a(n) for n = 1..17447</a>
%F a(n) = A218608(n-1)+1.
%o (Scheme): (define (A218606 n) (1+ (A218608 (-1+ n))))
%Y Cf. A218604, A218605, A218608.
%K nonn
%O 1,2
%A _Antti Karttunen_, Nov 03 2012
%E Definition changed because of the changed offset of A218604. - _Antti Karttunen_, Nov 10 2012