Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136398
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136398 Triangle read by rows of coefficients of Chebyshev-like polynomials P_{n,6}(x) with 0 omitted (exponents in increasing order). +0
1
1, -6, 2, 15, -13, 4, -20, 36, -28, 8, 15, -55, 85, -60, 16, -6, 50, -146, 198, -128, 32, 1, -27, 155, -377, 456, -272, 64, 8, -104, 456, -952, 1040, -576, 128, -1, 43, -363, 1289, -2360, 2352, -1216, 256, -10, 190, -1182, 3530, -5760, 5280, -2560, 512 (list; graph; listen)
OFFSET

6,2

COMMENT

If U_n(x), T_n(x) are Chebyshev's polynomials then U_n(x)=P_{n,0}(x), T_n(x)=P_{n,1}(x).

Let n>=6 and k be of the same parity. Consider a set X consisting of (n+k)/2-6 blocks of the size 2 and an additional block of the size 6, then (-1)^((n-k)/2)a(n,k) is the number of n-6-subsets of X intersecting each block of the size 2.

LINKS

Milan Janjic, Two enumerative functions.

FORMULA

If n>=6 and k are of the same parity then a(n,k)= (-1)^((n-k)/2)*sum((-1)^i*binomial((n+k)/2-6, i)*binomial(n+k-6-2*i, n-6), i=0..(n+k)/2-6), and a(n,k)=0 if n and k are of different parity.

EXAMPLE

Rows are (1),(-6,2),(15,-13,4),... since P_{6,6}=x^6, P_{7,6}=-6x^5+2x^7, P_{8,6}=15x^4-13x^6+4x^8,...

MAPLE

if modp(n-k, 2)=0 then a[n, k]:=(-1)^((n-k)/2)*sum((-1)^i*binomial((n+k)/2-6, i)*binomial(n+k-6-2*i, n-6), i=0..(n+k)/2-6); end if;

CROSSREFS

Cf. A008310, A053117.

Sequence in context: A069268 A082155 A128225 this_sequence A081778 A055943 A090033

Adjacent sequences: A136395 A136396 A136397 this_sequence A136399 A136400 A136401

KEYWORD

sign

AUTHOR

Milan R. Janjic (agnus(AT)blic.net), Mar 30 2008, revised Apr 05 2008

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research