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