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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218545 First differences of A218784. Lengths of runs in A213728 and A213729. 9
1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 4, 1, 2, 2, 3, 1, 2, 1, 1, 3, 1, 1, 2, 2, 3, 1, 2, 1, 1, 4, 2, 1, 6, 2, 2, 1, 2, 2, 3, 1, 2, 1, 1, 4, 2, 1, 6, 2, 1, 1, 2, 1, 6, 3, 3, 5, 2, 1, 1, 1, 2, 2, 3, 1, 2, 1, 1, 4, 2, 1, 6, 2, 1, 1, 2, 1, 6, 3, 3, 5, 2, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

These numbers tell how many times the infinite trunk of beanstalk (A179016) branches into the same direction, before changing the direction.

LINKS

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

FORMULA

a(n) = A218784(n)-A218784(n-1).

PROG

(Scheme): (define (A218545 n) (- (A218784 n) (A218784 (-1+ n))))

CROSSREFS

A218546 gives the positions of records. Cf. also A218547. Also the first differences of A218544, i.e. a(n) = A218544(n+1)-A218544(n).

Sequence in context: A213636 A192393 A184303 * A205600 A133162 A276172

Adjacent sequences:  A218542 A218543 A218544 * A218546 A218547 A218548

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 02 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 December 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)