Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Nov 10 2012 14:16:33
%S 1,2,4,6,9,14,23,34,36,37,38,40,51,53,54,55,56,59,70,81,83,84,85,86,
%T 89,102,119,124,135,137,138,139,140,143,156,173,180,197,208,213,222,
%U 233,235,236,237,238,241,254,271,278,295,306,311,322,339,350,355,370,375
%N a(n) = A218607(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 least possible position of its allotted "window" which it at that point must pass through. (See comments at A218603 and A218607.)
%H Antti Karttunen, <a href="/A218605/b218605.txt">Table of n, a(n) for n = 1..7949</a>
%F a(n) = A218607(n-1)+1.
%o (Scheme): (define (A218605 n) (1+ (A218607 (-1+ n))))
%Y Cf. A218603, A218606, A218607.
%K nonn
%O 1,2
%A _Antti Karttunen_, Nov 03 2012
%E Definition changed because of the changed offset of A218603. - _Antti Karttunen_, Nov 10 2012