Skip to content

A093382

OEIS Lean4

a(n) = length k of longest binary sequence x(1) … x(k) such that for no n <= i < j <= k/2 is x(i) … x(2i) a subsequence of x(j) … x(2j).

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