A376572 Triangle read by rows: T(n,k) is the frequency of the symbol k in the lexicographically earliest minimal superpermutation on n symbols, where the symbols are {1, 2, ..., n}.

1, 2, 1, 4, 3, 2, 10, 9, 8, 6, 32, 33, 31, 31, 26

Offset: 1

Author

Paolo Xausa, Sep 28 2024

Keywords

• nonn
• tabl
• hard
• more

Comments

Equivalently, T(n,k) is the frequency of k in row n of A332089 (see there for more information).

Examples

			Triangle begins:
  n\k|  1   2   3   4   5  ...
  ----------------------------
   1 |  1;
   2 |  2,  1;
   3 |  4,  3,  2;
   4 | 10,  9,  8,  6;
   5 | 32, 33, 31, 31, 26;
  ...
For n = 3, the minimal superpermutation is 123121321; symbol 1 appears 4 times, symbol 2 appears 3 times and symbol 3 appears 2 times.
		

Links

• Michael Engen and Vincent Vatter, Containing All Permutations, The American Mathematical Monthly, 128 (1), 2021, pp. 4-24 (preprint version).
• Wikipedia, Superpermutation.

Crossrefs

Cf. A180632 (row sums, for n >= 1), A332089.