cp's OEIS Frontend

A051290 Triangular array T read by rows: T(n,k)=P(2n+3,n,2k+3), 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 A051290 #14 Aug 13 2024 05:00:25
%S A051290 1,4,1,12,6,3,32,24,24,4,80,80,120,40,10,192,240,480,240,120,15,448,
%T A051290 672,1680,1120,840,210,35,1024,1792,5376,4480,4480,1680,560,56,2304,
%U A051290 4608,16128,16128,20160,10080,5040,1008,126
%N A051290 Triangular array T read by rows: T(n,k)=P(2n+3,n,2k+3), 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 A051290 P(n,k,n) counts palindromes.
%e A051290 Triangle begins:
%e A051290    1;
%e A051290    4,  1;
%e A051290   12,  6,   3;
%e A051290   32, 24,  24, 4,
%e A051290   80, 80, 120, 40, 10;
%e A051290   ...
%Y A051290 Cf. A051287, A051288, A051289.
%K A051290 nonn,tabl
%O A051290 0,2
%A A051290 _Clark Kimberling_