Skip to content

A094859

OEIS Lean4

Maximal number of longest common subsequences between any two ternary strings of length n (Version 2).

offset: 1
codomain: ℕ

The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.

low confidence