Sum of the distances between the 2^n vertices in the De Bruijn Graphs on words of length n on alphabet {0,1}.
A058052
Sum of the distances between the 2^n vertices in the De Bruijn Graphs on words of length n on alphabet {0,1}.
Terms
- a(0) =2a(1) =18a(2) =118a(3) =680a(4) =3620a(5) =18274a(6) =88760a(7) =418900a(8) =1933904a(9) =8775534a(10) =39277136a(11) =173843142a(12) =762388102a(13) =3317784992a(14) =14344443516a(15) =61671799608a(16) =263865053452
External references
- oeis: A058052