cp's OEIS Frontend

A251768 Run lengths in A251539.

%I A251768 #11 Aug 01 2018 10:54:19
%S A251768 7,1,10,1,10,1,10,1,10,1,10,4,1,8,1,10,1,10,1,10,1,10,1,10,1,10,2,10,
%T A251768 1,10,1,10,1,10,1,10,1,10,1,10,2,10,1,10,1,10,1,10,1,10,1,10,1,10,3,1,
%U A251768 8,1,10,1,10,1,10,1,10,1,10,1,10,2,10,1,10,1,10
%N A251768 Run lengths in A251539.
%H A251768 Reinhard Zumkeller, <a href="/A251768/b251768.txt">Table of n, a(n) for n = 1..10000</a>
%t A251768 max = 2000 (* = max term of A251538 *);
%t A251768 A098548 = {1, 2, 3};
%t A251768 For[n = 4, n <= 8 max, n++, If[GCD[n, A098548[[-1]]] == 1 && GCD[n, A098548[[-2]]] > 1, AppendTo[A098548, n]]];
%t A251768 A251538 = Select[Range[max], A098548[[2 # + 3]] > A098548[[2 # + 1]] + 6&];
%t A251768 A251539 = Differences[A251538];
%t A251768 Length /@ Split[A251539] (* _Jean-François Alcover_, Aug 01 2018 *)
%o A251768 (Haskell)
%o A251768 import Data.List (group)
%o A251768 a251768 n = a251768_list !! (n-1)
%o A251768 a251768_list = map length $ group a251539_list
%Y A251768 Cf. A249943, A251767.
%K A251768 nonn
%O A251768 1,1
%A A251768 _Reinhard Zumkeller_, Dec 08 2014