login
Terms b(k) (for k > 0, and in order of appearance) such that both |b(k) - b(k-1)| and |b(k+1) - b(k)| are greater than 1, where b is A377091.
4

%I #27 Jan 25 2025 02:48:14

%S 13,18,25,24,-40,-50,-60,-72,-71,-84,-80,98,113,104,128,119,145,162,

%T 181,-200,-220,-242,-226,-264,-248,-288,-272,-314,-339,337,321,-338,

%U 366,394,369,365,374,-422,419,403,399,393,402,398,404,452,427,-482,479,451,478,-512

%N Terms b(k) (for k > 0, and in order of appearance) such that both |b(k) - b(k-1)| and |b(k+1) - b(k)| are greater than 1, where b is A377091.

%C Terms in A377091 corresponding to the length of runs = 1 in A379880.

%H Paolo Xausa, <a href="/A380224/b380224.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A377091(A380225(n)).

%t (* A377091list is defined at A377091 *)

%t Flatten[Select[Most[Split[A377091list[1000], Abs[#2 - #1] == 1 &]], Length[#] == 1 &]] (* _Paolo Xausa_, Jan 20 2025 *)

%Y Cf. A377091, A379880, A380223, A380225 (corresponding k's).

%K sign

%O 1,1

%A _Paolo Xausa_, Jan 18 2025