This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A218545 #14 Jun 23 2025 22:18:04 %S A218545 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, %T A218545 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, %U A218545 1,1,4,2,1,6,2,1,1,2,1,6,3,3,5,2,2,2,1 %N A218545 First differences of A218784. Lengths of runs in A213728 and A213729. %C A218545 These numbers tell how many times the infinite trunk of beanstalk (A179016) branches into the same direction, before changing the direction. %H A218545 Antti Karttunen, <a href="/A218545/b218545.txt">Table of n, a(n) for n = 1..8650</a> %F A218545 a(n) = A218784(n)-A218784(n-1). %o A218545 (Scheme) (define (A218545 n) (- (A218784 n) (A218784 (-1+ n)))) %Y A218545 A218546 gives the positions of records. Cf. also A218547. Also the first differences of A218544, i.e. a(n) = A218544(n+1)-A218544(n). %K A218545 nonn %O A218545 1,2 %A A218545 _Antti Karttunen_, Nov 02 2012