A214213 Erroneous version of A005942.

1, 2, 4, 6, 2, 12, 16, 4, 6, 24, 28, 32, 36, 8, 10, 12, 14, 48, 52, 56, 60, 64, 68, 72, 76, 16, 18, 20, 22, 24, 26, 28, 30, 96, 100, 104, 108, 112, 116, 120, 124, 128, 132, 136, 140, 144, 148, 152, 156, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 192, 196, 200, 204, 208, 212, 216, 220, 224, 228, 232, 236, 240, 244, 248, 252, 256, 260, 264

Offset: 0

Author

N. J. A. Sloane, Jul 10 2012

Keywords

• dead

Links

• F. Mignosi, A. Restivo, M. Sciortino, Words and forbidden factors, WORDS (Rouen, 1999). Theoret. Comput. Sci. 273 (2002), no. 1-2, 99--117. MR1872445 (2002m:68096). Example 20, page 11, the complexity g_t(n) of the Thue-Morse word A010060. There is a typo in the fourth clause of the definition of g_t(n).
• Included in accordance with the OEIS policy of including incorrect published sequences with pointers to the correct versions.

Crossrefs

Cf. A005942.

Programs

Maple

f:=proc(n) local m;
if n <= 2 then 2^n;
else m:=floor(log(n-1)/log(2))-1;
     if n <= 3*2^m then 4*n-2^(m+1)-4;
     else 2*n-2^(m+2)-2; # should have been 2*n+2^(m+2)-2
     fi;
fi;
end;