This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A329870 #5 Nov 26 2019 20:03:13
%S A329870 0,0,1,2,2,1,1,3,2,3,3,2,3,1,1,3,4,2,4,2,3,3,3,3,2,4,2,4,3,1,1,3,4,3,
%T A329870 3,4,4,3,4,5,2,4,4,5,3,3,3,3,5,4,4,2,5,4,3,4,4,3,3,4,3,1,1,3,4,3,3,4,
%U A329870 3,2,3,3,4,4,2,3,3,3,4,5,4,3,4,2,5,4
%N A329870 Runs-resistance of the binary expansion of n without the first digit.
%C A329870 For the operation of taking the sequence of run-lengths of a finite sequence, runs-resistance is defined to be the number of applications required to reach a singleton.
%e A329870 Minimal representatives with each image are:
%e A329870 2: (0)
%e A329870 4: (0,0) -> (2)
%e A329870 5: (0,1) -> (1,1) -> (2)
%e A329870 9: (0,0,1) -> (2,1) -> (1,1) -> (2)
%e A329870 18: (0,0,1,0) -> (2,1,1) -> (1,2) -> (1,1) -> (2)
%e A329870 41: (0,1,0,0,1) -> (1,1,2,1) -> (2,1,1) -> (1,2) -> (1,1) -> (2)
%e A329870 150: (0,0,1,0,1,1,0) -> (2,1,1,2,1) -> (1,2,1,1) -> (1,1,2) -> (2,1) -> (1,1) -> (2)
%t A329870 Table[Length[NestWhileList[Length/@Split[#]&,Rest[IntegerDigits[n,2]],Length[#]>1&]]-1,{n,2,100}]
%Y A329870 Keeping the first digit gives A318928.
%Y A329870 Cuts-resistance is A319420.
%Y A329870 Compositions counted by runs-resistance are A329744.
%Y A329870 Binary words counted by runs-resistance are A319411 and A329767.
%Y A329870 Cf. A107907, A319416, A329860, A329861, A329865, A329867.
%K A329870 nonn
%O A329870 2,4
%A A329870 _Gus Wiseman_, Nov 25 2019