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 A106836 #15 Feb 21 2015 15:35:50 %S A106836 3,3,1,4,1,2,1,4,3,1,1,3,1,2,1,4,3,1,4,1,2,1,1,3,3,1,1,3,1,2,1,4,3,1, %T A106836 4,1,2,1,4,3,1,1,3,1,2,1,1,3,3,1,4,1,2,1,1,3,3,1,1,3,1,2,1,4,3,1,4,1, %U A106836 2,1,4,3,1,1,3,1,2,1,4,3,1,4,1,2,1,1,3,3,1,1,3,1,2,1,1,3,3,1,4,1,2,1 %N A106836 First differences of A060833 and (from a(2) onward) also of A091067 and A255068. %C A106836 From _Antti Karttunen_, Feb 20 2015: (Start) %C A106836 Among the terms a(1) .. a(8192), 1 occurs 4095 times, 2 occurs 1024 times, 3 occurs 2048 times and 4 occurs 1025 times. No larger numbers can ever occur. %C A106836 That these are the first differences of not just A091067 and A255068, but also of A060833 follows from _N. Sato_'s Feb 12 2013 comment in the latter that "For n > 1, n is in the sequence (A060833) if and only if A038189(n-1) = 1." %C A106836 Also length of runs in A236840 and A255070. %C A106836 (End) %H A106836 Antti Karttunen, <a href="/A106836/b106836.txt">Table of n, a(n) for n = 1..8192</a> %F A106836 a(1) = 3, and for n > 1: a(n) = A091067(n) - A091067(n-1). - _Antti Karttunen_, Feb 20 2015 %o A106836 (Scheme) (define (A106836 n) (if (= 1 n) 3 (- (A091067 n) (A091067 (- n 1))))) %Y A106836 Cf. A060833, A088742, A091067, A106837, A236840, A255058, A255068, A255070. %K A106836 nonn %O A106836 1,1 %A A106836 _Ralf Stephan_, May 03 2005 %E A106836 Name edited by _Antti Karttunen_, Feb 20 2015