A369206 Irregular triangle read by rows: row n lists the number of U characters for each of the strings of the MIU formal system at the n-th level of the tree generated by recursively applying the system rules, starting from the MI string.

0, 1, 0, 2, 1, 0, 4, 2, 1, 0, 1, 1, 8, 4, 2, 2, 2, 1, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 16, 8, 4, 3, 3, 3, 3, 4, 4, 0, 2, 2, 2, 2, 2, 2, 2, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 3, 4, 4

Offset: 0

Author

Paolo Xausa, Jan 16 2024

Keywords

• nonn
• base
• tabf

Comments

See A368946 for the description of the MIU formal system and the triangle of corresponding strings.

Examples

			Triangle begins:
  [0] 0;
  [1] 1 0;
  [2] 2 1 0;
  [3] 4 2 1 0 1 1;
  [4] 8 4 2 2 2 1 0 1 1 1 1 1 1 2 2 2;
  ...
		

References

• Douglas R. Hofstadter, Gödel, Escher, Bach: an Eternal Golden Braid, Basic Books, 1979, pp. 33-41 and pp. 261-262.

Links

• Paolo Xausa, Table of n, a(n) for n = 0..3670 (rows 0..7 of the triangle, flattened).
• Wikipedia, MU Puzzle.
• Index entries for sequences from "Goedel, Escher, Bach".

Crossrefs

Cf. A055641, A368946, A368947 (row lengths), A369172, A369207 (number of ones).

Programs

Mathematica

MIUStepOW3[s_] := Flatten[Map[{If[StringEndsQ[#, "1"], # <> "0", Nothing], # <> #, StringReplaceList[#, "111" -> "0"], StringReplaceList[#, "00" -> ""]}&, s]];
With[{rowmax = 5}, Map[StringCount[#, "0"]&, NestList[MIUStepOW3, {"1"}, rowmax]]]

Formula

T(n,k) = A055641(A368946(n,k)).

T(n,k) = A369172(n,k) - A369207(n,k) - 1.