A218604 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A218604

a(n) = A173601(n)-A179016(n).

0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 2, 2, 2, 0, 1, 0, 0, 1, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 5, 0, 1, 0, 0, 1, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 5, 1, 2, 2, 3, 2, 2, 0, 0, 0, 0, 1, 3, 2, 0, 1, 0, 0, 1, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 5, 1, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,19

COMMENTS

For all n, the following holds: A213708(n) <= A179016(n) <= A173601(n). This sequence gives the distance of the node n in the infinite trunk of beanstalk (A179016(n)) from the greater edge of the A086876(n) wide window which it at that point must pass through.

The increasing steps seem to be quite constrained in their magnitude, compared to the decreasing steps. (This depends on how the "tendrils",i.e. the finite side-trees on the other side of the infinite trunk grow and reach their tops).

LINKS

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

PROG

(Scheme): (define (A218604 n) (- (A173601 n) (A179016 n)))

CROSSREFS

a(n) = A086876(n)-A218603(n)-1. Positions of zeros: A218608, A218606.

Sequence in context: A179835 A110857 A108867 * A095767 A241922 A071446

Adjacent sequences: A218601 A218602 A218603 * A218605 A218606 A218607

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 03 2012

EXTENSIONS

Offset changed because of the changed offset of A179016 - Antti Karttunen, Nov 10 2012

STATUS

approved