%I A051287
%S A051287 1,1,1,1,2,1,1,2,2,1,1,4,4,4,1,1,4,4,4,4,1,1,6,12,8,12,6,1,1,6,12,8,8,
%T A051287 12,6,1,1,8,24,32,16,32,24,8,1,1,8,24,32,16,16,32,24,8,1,1,10,40,80,80,
%U A051287 32,80,80,40,10,1,1,10,40,80,80,32,32,80
%N A051287 Triangular array T read by rows: T(n,k)=P(n,k,|n-2k|), where P(n,k,c)=number 
               of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) 
               for exactly c values of i.
%C A051287 P(n,k,n) counts palindromes.
%e A051287 Rows: {1}; {1,1}; {1,2,1}; ...
%Y A051287 Sequence in context: A106476 A101566 A156074 this_sequence A049705 A060236 
               A006345
%Y A051287 Adjacent sequences: A051284 A051285 A051286 this_sequence A051288 A051289 
               A051290
%K A051287 nonn,tabl
%O A051287 0,5
%A A051287 Clark Kimberling (ck6(AT)evansville.edu)