Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051287
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
1
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, 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, 32, 80, 80, 40, 10, 1, 1, 10, 40, 80, 80, 32, 32, 80 (list; table; graph; listen)
OFFSET

0,5

COMMENT

P(n,k,n) counts palindromes.

EXAMPLE

Rows: {1}; {1,1}; {1,2,1}; ...

CROSSREFS

Adjacent sequences: A051284 A051285 A051286 this_sequence A051288 A051289 A051290

Sequence in context: A071201 A106476 A101566 this_sequence A049705 A060236 A006345

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research