login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058052 Sum of the distances between the 2^n vertices in the De Bruijn Graphs on words of length n on alphabet {0,1}. 0
2, 18, 118, 680, 3620, 18274, 88760, 418900 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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)

LINKS

Table of n, a(n) for n=1..8.

EXAMPLE

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

CROSSREFS

Sequence in context: A027433 A153338 A007798 * A119578 A052610 A052653

Adjacent sequences:  A058049 A058050 A058051 * A058053 A058054 A058055

KEYWORD

nonn

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 22 11:34 EDT 2019. Contains 326176 sequences. (Running on oeis4.)