A218606 - 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

A218606

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

1, 2, 3, 5, 7, 8, 10, 11, 13, 15, 16, 22, 24, 25, 39, 41, 42, 62, 63, 64, 65, 69, 71, 72, 92, 93, 94, 95, 105, 106, 107, 108, 114, 123, 125, 126, 146, 147, 148, 149, 159, 160, 161, 162, 168, 183, 184, 185, 186, 192, 203, 221, 223, 224, 244, 245, 246, 247, 257

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

OFFSET

1,2

COMMENTS

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 greatest possible position of the allotted "window" which it at that point must pass through. (See comments at A218604.)

LINKS

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

FORMULA

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

PROG

(Scheme): (define (A218606 n) (1+ (A218608 (-1+ n))))

CROSSREFS

Cf. A218604, A218605, A218608.

Sequence in context: A295282 A066093 A022342 * A077164 A364444 A062132

Adjacent sequences: A218603 A218604 A218605 * A218607 A218608 A218609

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 03 2012

EXTENSIONS

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

STATUS

approved