Skip to content

A080804

OEIS Lean4

Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).

offset: 1
codomain: ℕ
n123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
A08080413467891112131415161718202122232425262728293031323334353738394041424344454647484950515253545556575859606162636465666768707172737475767778798081828384858687888990919293949596979899100101102103104105106