|
%I #19 Dec 31 2016 18:26:17
%S 1,12,112,122,1122,11122,11212,11222,12122,111222,112122,1111222,
%T 1112122,1112212,1112222,1121222,1211222,11112222,11121222,111112222,
%U 111121222,111122122,111122212,111122222,111211222,111212122,111212222,111221222,111222122,112111222,112112222,112121222,121112222
%N List of minimal palindromic words over {1,2} that begin with 1, and have lengths 1, 2, 3, ....
%C These are words of length k which do not contain any (scattered) palindromic subsequence of length greater than ceiling(k/2).
%H Lars Blomberg, <a href="/A225189/b225189.txt">Table of n, a(n) for n = 1..10000</a>
%H S. Holub and K. Saari, <a href="http://dx.doi.org/10.1016/j.dam.2008.03.039">On highly palindromic words</a>, Discrete Applied Mathematics, 157 (2009) 953-959.
%Y Cf. A225368.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, May 06 2013
%E Reordered terms into ascending order, _Lars Blomberg_, Dec 31 2016
|
