|
%I #1 Jun 12 2004 03:00:00
%S 0,1,2,0,0,2,1,0,0,0,1,1,0,1,0,2,2,0,1,0,0,1,0,1,1,1,2,1,1,0,0,2,0,2,
%T 0,0,0,0,2,2,1,2,2,2,0,0,1,2,1,0,1,2,2,0,2,1,1,1,0,2,0,1,1,2,0,1,2,0,
%U 2,2,2,1,0,2,1,2,0,0,0,1,0,0,0,0,0,1,2,0,1,0,1,0,0,2,1,1,2,2,1,1,0,1,1,0,0
%N a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 3).
%C A "substrings maximizer sequence" (or SMS) in base 3.
%Y See A093691 for more information.
%Y Cf. A093691, A093692, A079101, A038219, A080415.
%K nonn
%O 1,3
%A Alejandro V. Dau (ad1n(AT)dc.uba.ar), Apr 11 2004
|
