cp's OEIS Frontend

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.

%I A051287 #9 Sep 01 2021 22:12:29
%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,
%U A051287 80,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.
%H A051287 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a051/A051287.java">Java program</a> (github)
%e A051287 Rows: {1}; {1,1}; {1,2,1}; ...
%K A051287 nonn,tabl
%O A051287 0,5
%A A051287 _Clark Kimberling_