The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A218603 a(n) = A179016(n)-A213708(n) 9
 0, 0, 1, 0, 1, 0, 1, 3, 0, 1, 3, 2, 3, 0, 1, 3, 2, 2, 1, 1, 1, 3, 0, 1, 3, 2, 2, 1, 1, 1, 2, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 3, 2, 2, 1, 1, 1, 2, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 3, 5, 3, 5, 4, 2, 3, 5, 0, 1, 3, 2, 2, 1, 1, 1, 2, 1, 1, 0, 1, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 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 lesser 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 (A218603 n) (- (A179016 n) (A213708 n))) CROSSREFS a(n) = A086876(n)-A218604(n)-1. Positions of zeros: A218607, A218605. Sequence in context: A084475 A130028 A129560 * A207032 A169940 A279010 Adjacent sequences:  A218600 A218601 A218602 * A218604 A218605 A218606 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 10 19:52 EDT 2020. Contains 336381 sequences. (Running on oeis4.)