A251768 Run lengths in A251539.

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, 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, 8, 1, 10, 1, 10, 1, 10, 1, 10, 1, 10, 1, 10, 2, 10, 1, 10, 1, 10

Offset

1,1

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Mathematica

max = 2000 (* = max term of A251538 *);
A098548 = {1, 2, 3};
For[n = 4, n <= 8 max, n++, If[GCD[n, A098548[[-1]]] == 1 && GCD[n, A098548[[-2]]] > 1, AppendTo[A098548, n]]];
A251538 = Select[Range[max], A098548[[2 # + 3]] > A098548[[2 # + 1]] + 6&];
A251539 = Differences[A251538];
Length /@ Split[A251539] (* Jean-François Alcover, Aug 01 2018 *)

Prog

(Haskell)
import Data.List (group)
a251768 n = a251768_list !! (n-1)
a251768_list = map length $ group a251539_list

Crossrefs

Cf. A249943, A251767.

Sequence in context: A197019 A048835 A124970 * A338561 A349140 A178034

Adjacent sequences: A251765 A251766 A251767 * A251769 A251770 A251771

Keyword

nonn

Author

Reinhard Zumkeller, Dec 08 2014

Status

approved