login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218604 a(n) = A173601(n)-A179016(n). 10
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

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 10:08 EST 2019. Contains 329261 sequences. (Running on oeis4.)