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 A200651 #18 Jul 07 2023 04:49:48
%S A200651 1,1,1,2,1,3,2,1,2,3,3,2,1,4,3,3,2,3,3,2,1,2,5,3,4,3,4,3,3,2,3,3,2,1,
%T A200651 4,3,5,4,3,5,4,3,2,5,3,4,3,4,3,3,2,3,3,2,1,2,5,3,6,5,5,4,3,4,5,5,4,3,
%U A200651 4,3,5,4,3,5,4,3,2,5,3,4,3,4,3,3,2,3,3
%N A200651 Number of equal bit-runs in Stolarsky Representation of n.
%C A200651 For the Stolarsky representation of n, see the C. Mongoven link.
%H A200651 Amiram Eldar, <a href="/A200651/b200651.txt">Table of n, a(n) for n = 1..10000</a>
%H A200651 Casey Mongoven, <a href="/A200648/a200648_1.txt">Description of Stolarsky Representations</a>.
%e A200651 The Stolarsky representation of 19 is 11101. This has 3 equal bit-runs: '111', '0' and '1'. So a(19) = 3.
%t A200651 stol[n_] := stol[n] = If[n == 1, {}, If[n != Round[Round[n/GoldenRatio]*GoldenRatio], Join[stol[Floor[n/GoldenRatio^2] + 1], {0}], Join[stol[Round[n/GoldenRatio]], {1}]]];
%t A200651 a[n_] := If[n == 1, 1, Length[Split[stol[n]]]]; Array[a, 100] (* _Amiram Eldar_, Jul 07 2023 *)
%o A200651 (PARI) stol(n) = {my(phi=quadgen(5)); if(n==1, [], if(n != round(round(n/phi)*phi), concat(stol(floor(n/phi^2) + 1), [0]), concat(stol(round(n/phi)), [1])));}
%o A200651 a(n) = {my(s = stol(n), c = 1); for(k = 1, #s-1, if(s[k+1] != s[k], c++)); c; } \\ _Amiram Eldar_, Jul 07 2023
%Y A200651 Cf. A200647, A200648, A200649, A200650.
%K A200651 nonn,base
%O A200651 1,4
%A A200651 _Casey Mongoven_, Nov 19 2011
%E A200651 More terms from _Amiram Eldar_, Jul 07 2023