1,1

Given two words X,Y in {0,1}^N, the distance d(X,Y) is the least integer K such that there exists a word M with X=UM and Y=MV and |U|=|V|=K Define a(N)=sum(d(X,Y); X,Y in {0,1}^N)

d(0,0)=0 d(0,1)=1 d(1,0)=1 d(1,1)=0 hence a(1)=0+1+1+0=2 d(00,00)=0 d(00,01)=1 d(00,10)=2 d(00,11)=2 d(01,00)=2 d(01,01)=0 d(01,10)=1 d(01,11)=1 d(10,00)=1 d(10,01)=1 d(10,10)=0 d(10,11)=2 d(11,00)=2 d(11,01)=2 d(11,10)=1 d(11,11)=0 hence a(2)=0+1+2+2+2+0+1+1+1+1+0+2+2+2+1+0=18

Adjacent sequences: A058049 A058050 A058051 this_sequence A058053 A058054 A058055

Sequence in context: A064837 A027433 A007798 this_sequence A119578 A052610 A052653

nonn

Serge Burckel (burckel(AT)iml.univ-mrs.fr), Nov 19 2000