A218607 The positions of zeros in A218603, i.e., those integers i for which A179016(i) = A213708(i).

0, 1, 3, 5, 8, 13, 22, 33, 35, 36, 37, 39, 50, 52, 53, 54, 55, 58, 69, 80, 82, 83, 84, 85, 88, 101, 118, 123, 134, 136, 137, 138, 139, 142, 155, 172, 179, 196, 207, 212, 221, 232, 234, 235, 236, 237, 240, 253, 270, 277, 294, 305, 310, 321, 338, 349, 354, 369, 374, 383, 400

Offset

0,3

Comments

These are the points i for which the corresponding node 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, i.e., there are no leaves or side-trees at its left (lesser) side at these points. (See comments at A218603.)

Links

Antti Karttunen, Table of n, a(n) for n = 0..7948

Prog

(Scheme with Antti Karttunen's intseq-library): (define A218607 (ZERO-POS 0 0 A218603))

Crossrefs

Apart from first two terms, a subset of A213732. Cf. A218608, A218605.

Sequence in context: A024885 A180459 A133605 * A289916 A014252 A296378

Adjacent sequences: A218604 A218605 A218606 * A218608 A218609 A218610

Keyword

nonn

Author

Antti Karttunen, Nov 10 2012

Status

approved