|
%I #10 Nov 22 2017 01:15:05
%S 6,3,10,5,9,3,6,3,9,6,3,9,3,6,6,3,10,5,3,9,10,9,6,3,6,3,9,6,3,9,5,9,3,
%T 6,6,3,9,10,3,5,10,9,3,5,9,3,6,3,9,3,6,6,3,10,5,3,6,3,6,9,3,6,3,6,3,5,
%U 10,3,9,5,3,10,9,3,5,10,3,6,6,3,10,5,9,3,10,9,3,6,6
%N Gaps between single 1's in the Kolakoski sequence A000002.
%C Except the first term, equals first difference of A249942.
%C The only possible values are 3, 5, 6, 9 and 10: a(n) cannot take the value 2, because it would imply the word 21212 which does not appear in the OK sequence; a(n) = 3 with the word 212-212, a(n) = 5 with 212-11-212, a(n) = 6 with 212-211-212 or 212-112-212, a(n) = 9 with 212-211-211-212 or 212-112-112-212, a(n) = 10 with 212-2112112-212. And from this it is easily seen that a(n) and a(n+1) cannot be equal unless a(n) = a(n+1) = 6 with the word 21-21122-1-22112-12.
%H Jean-Christophe Hervé, <a href="/A249948/b249948.txt">Table of n, a(n) for n = 1..10000</a>
%Y Cf. A000002, A054351, A054352, A249507, A249508, A249942.
%K nonn
%O 1,1
%A _Jean-Christophe Hervé_, Nov 09 2014
|
