Skip to content

A275646

OEIS Lean4

a(n) = maximal value of M such that it is possible to partition the 2^n vertices of the n-cube into M subsets so that the Hamming distance between any two subsets is exactly 1.

offset: 0
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