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 A369148 #20 Jan 18 2024 07:47:43
%S A369148 1,3,6,12,28,88,444,3671,47981,976631,29554002,1326494644
%N A369148 In the MIU formal system, total number (including duplicates) of strings up to n steps distant from the MI string.
%C A369148 See A368946 for the description of the MIU formal system.
%D A369148 Douglas R. Hofstadter, Gödel, Escher, Bach: an Eternal Golden Braid, Basic Books, 1979, pp. 33-41.
%H A369148 Wikipedia, <a href="https://en.wikipedia.org/wiki/MU_puzzle">MU Puzzle</a>.
%H A369148 <a href="/index/Go#GEB">Index entries for sequences from "Goedel, Escher, Bach"</a>.
%F A369148 a(n) >= A331536(n+1).
%t A369148 MIUStepW3[s_] := Flatten[Map[{If[StringEndsQ[#, "1"], # <> "0", Nothing], # <> #, StringReplaceList[#, {"111" -> "0", "00" -> ""}]}&, s]];
%t A369148 With[{rowmax = 9}, Accumulate[Map[Length, NestList[MIUStepW3, {"1"}, rowmax]]]]
%Y A369148 Cf. A331536 (without duplicates), A368946, A369173 (all MIU strings).
%Y A369148 Partial sums of A368947.
%K A369148 nonn,hard,more
%O A369148 0,2
%A A369148 _Paolo Xausa_, Jan 14 2024