A218608 The positions of zeros in A218604, i.e., those integers i for which A179016(i) = A173601(i).

0, 1, 2, 4, 6, 7, 9, 10, 12, 14, 15, 21, 23, 24, 38, 40, 41, 61, 62, 63, 64, 68, 70, 71, 91, 92, 93, 94, 104, 105, 106, 107, 113, 122, 124, 125, 145, 146, 147, 148, 158, 159, 160, 161, 167, 182, 183, 184, 185, 191, 202, 220, 222, 223, 243, 244, 245, 246, 256

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 greatest possible position of the allotted "window" which it at that point must pass through, i.e. there are no leaves or side-trees at its right (greater) side at these points. (See comments at A218604.)

Links

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

Prog

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

Crossrefs

Apart from zero, a subset of A213733. Cf. A218607, A218606.

Sequence in context: A189407 A189518 A213733 * A288475 A080711 A022301

Adjacent sequences: A218605 A218606 A218607 * A218609 A218610 A218611

Keyword

nonn

Author

Antti Karttunen, Nov 10 2012

Status

approved