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 A244228 #11 Jun 25 2014 13:12:49 %S A244228 2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3, %T A244228 2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,4,2,3,2,3,2,2,2,3,2,3,2,2, %U A244228 2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,4,2,3,2,3,2,2,2,3 %N A244228 The lengths of runs in A244225, the first differences of A244223. %C A244228 The sequence gives the distances between successive 1-terms in A244221, i.e. the odd representations in Greedy Catalan Base (A014418, A244161). %C A244228 a(56) = 4 is the first term larger than 3 in this sequence. Cf. the example section of A244226. %H A244228 Antti Karttunen, <a href="/A244228/b244228.txt">Table of n, a(n) for n = 1..7117</a> %F A244228 a(n) = 1 + A244227(n). %e A244228 The first odd term in A014418 is A014418(1) = 1, and the second occurs at A014418(3) = 11, and the third at A014418(6) = 101, and the fourth at A014418(8) = 111, thus the first three terms of this sequence are (3-1) = 2, (6-3) = 3, (8-6) = 2. %o A244228 (Scheme) %o A244228 (define (A244228 n) (+ 1 (A244227 n))) %Y A244228 One more than A244227. %Y A244228 First differences of A244223. %Y A244228 Cf. A244225. %K A244228 nonn %O A244228 1,1 %A A244228 _Antti Karttunen_, Jun 23 2014