%I #8 Jan 28 2025 09:39:49

%S 0,1,1,2,1,2,7,4,5,4,5,9,7,12,7,8,9,10,9,10,14,12,22,12,13,14,15,14,

%T 15,16,17,16,17,37,19,20,19,20,21,22,21,22,23,24,50,25,26,26,27,29,29,

%U 29,29,29,32,30,5,34,26,3,34,32,1,4,32,31,33,34,3,36,32,37,38,1,39

%N Split A377091 into sublists consisting of runs of terms with the same sign. Then a(n) is max(b) - min(b), where b is the n-th sublist.

%H Paolo Xausa, <a href="/A380588/b380588.txt">Table of n, a(n) for n = 1..2000</a>

%e A377091 with terms grouped by sign begins:

%e (0) (1 2) (-2 -1) (3 4 5) (-4 -3) (6 7 8) (-8 -7 -6 -5 -9 -10 -11 -12) ...

%e And the corresponding terms of the present sequence are therefore:

%e 0 1 1 2 1 2 7 ...

%t (* A377091list is defined at A377091 *)

%t Map[Max[#] - Min[#] &, Most[SplitBy[A377091list[2000], Sign]]]

%Y Cf. A377091, A379882, A380510, A380586, A380587.

%K nonn

%O 1,4

%A _Paolo Xausa_, Jan 27 2025