A218605 a(n) = A218607(n-1) + 1.

1, 2, 4, 6, 9, 14, 23, 34, 36, 37, 38, 40, 51, 53, 54, 55, 56, 59, 70, 81, 83, 84, 85, 86, 89, 102, 119, 124, 135, 137, 138, 139, 140, 143, 156, 173, 180, 197, 208, 213, 222, 233, 235, 236, 237, 238, 241, 254, 271, 278, 295, 306, 311, 322, 339, 350, 355, 370, 375

Offset: 1

Author

Antti Karttunen, Nov 03 2012

Keywords

• nonn

Comments

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.)

Links

• Antti Karttunen, Table of n, a(n) for n = 1..7949

Crossrefs

Cf. A218603, A218606, A218607.

Programs

Scheme

(define (A218605 n) (1+ (A218607 (-1+ n))))

Formula

a(n) = A218607(n-1) + 1.

Extensions

Definition changed because of the changed offset of A218603. - Antti Karttunen, Nov 10 2012