A218606 -id:A218606 - cp's OEIS frontend

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

Offset: 0

Antti Karttunen, Nov 03 2012

nonn

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

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

Positions of zeros: A218608, A218606.

Cf. A086876, A173601, A179016, A218603.

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

a(n) = A086876(n) - A218603(n) - 1.

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

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

Original entry on oeis.org

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

Antti Karttunen, Nov 10 2012

nonn

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

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

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

A218605 a(n) = A218607(n-1) + 1.

Original entry on oeis.org

1, 2, 4, 6, 9, 14, 23, 34, 36, 37, 38, 40, 51, 53, 54, 55, 56, 59, 70, 81, 83, 84, 85, 86, 89, 102, 119, 124, 135, 137, 138, 139, 140, 143, 156, 173, 180, 197, 208, 213, 222, 233, 235, 236, 237, 238, 241, 254, 271, 278, 295, 306, 311, 322, 339, 350, 355, 370, 375

Offset: 1

Antti Karttunen, Nov 03 2012

nonn

These are the points i for which the predecessor node (i.e. the vertex that is one step towards the root) 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. (See comments at A218603 and A218607.)

Antti Karttunen, Table of n, a(n) for n = 1..7949

Cf. A218603, A218606, A218607.

(define (A218605 n) (1+ (A218607 (-1+ n))))

a(n) = A218607(n-1) + 1.

Definition changed because of the changed offset of A218603. - Antti Karttunen, Nov 10 2012

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

Extensions

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

Views

Author

Keywords

Comments

Links

Crossrefs

A218605 a(n) = A218607(n-1) + 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

Extensions