login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
1, 4, 1, 12, 6, 3, 32, 24, 24, 4, 80, 80, 120, 40, 10, 192, 240, 480, 240, 120, 15, 448, 672, 1680, 1120, 840, 210, 35, 1024, 1792, 5376, 4480, 4480, 1680, 560, 56, 2304, 4608, 16128, 16128, 20160, 10080, 5040, 1008, 126 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

P(n,k,n) counts palindromes.

LINKS

Table of n, a(n) for n=0..44.

EXAMPLE

Rows: (1); (4,1}; {12,6,3}; ...

CROSSREFS

Sequence in context: A106194 A272099 A217234 * A227338 A125105 A144878

Adjacent sequences:  A051287 A051288 A051289 * A051291 A051292 A051293

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 07:17 EST 2018. Contains 318053 sequences. (Running on oeis4.)