A369588 Triangular array read by rows: T(m,n) = number of Yamanouchi words of length m that start with n, m >= 1, n = 1..m.

1, 1, 1, 2, 1, 1, 4, 3, 2, 1, 10, 7, 5, 3, 1, 26, 20, 14, 11, 4, 1, 76, 56, 44, 31, 19, 5, 1, 232, 182, 139, 106, 69, 29, 6, 1, 764, 589, 475, 351, 265, 127, 41, 7, 1, 2620, 2088, 1658, 1303, 971, 583, 209, 55, 8, 1, 9496, 7522, 6146, 4846, 3734, 2446, 1106, 319, 71, 9, 1, 35696, 28820, 23495, 19108, 14629, 10616, 5323, 1904, 461, 89, 10, 1

Offset

1,4

Links

Table of n, a(n) for n=1..78.

Wikipedia, Lattice word.

Example

Array starts with
  m=1:  1
  m=2:  1,  1
  m=3:  2,  1,  1
  m=4:  4,  3,  2,  1
  m=5: 10,  7,  5,  3,  1
  m=6: 26, 20, 14, 11,  4, 1
  m=7: 76, 56, 44, 31, 19, 5, 1

Crossrefs

Sum in the m-th row equals T(m+1,1) = A000085(m).

Columns: A000085 (n=1), A238124 (n=2), A369590 (n=3).

Cf. A369589.

Sequence in context: A074744 A341474 A339303 * A010360 A262357 A112744

Adjacent sequences: A369585 A369586 A369587 * A369589 A369590 A369591

Keyword

nonn,tabl

Author

Max Alekseyev, Jan 26 2024

Status

approved