%I A100833
%S A100833 1,2,3,1,2,4,1,2,3,1,2,5,1,2,3,1,2,4,1,2,3,1,2,6,1,2,3,1,2,4,1,2,3,1,2,
%T A100833 5,1,2,3,1,2,4,1,2,3,1,2,7,1,2,3,1,2,4,1,2,3,1,2,5,1,2,3,1,2,4,1,2,3,1,
%U A100833 2,6,1,2,3,1,2,4,1,2,3,1,2,5,1,2,3,1,2,4,1,2,3,1,2,8,1,2,3,1,2,4,1,2,3
%N A100833 Smallest positive palindrome-free and square-free sequence.
%C A100833 a(1)=1 and, for n>1, a(n) is the smallest positive integer such that 
               no subsequence of two or more consecutive terms is a palindrome and 
               no subsequence of 2k consecutive terms, k>=1, consists of two copies 
               of the same subsequence.
%Y A100833 Sequence in context: A081514 A109206 A088422 this_sequence A097293 A026793 
               A072193
%Y A100833 Adjacent sequences: A100830 A100831 A100832 this_sequence A100834 A100835 
               A100836
%K A100833 nonn
%O A100833 1,2
%A A100833 John W. Layman (layman(AT)math.vt.edu), Jan 07 2005