Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063420
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063420 Coefficient array for certain numerator polynomials N3(n,x), n >= 0 (rising powers of x) used for trinomials. +0
5
1, 1, 1, 2, -1, 1, 1, -1, 3, -2, 1, 3, -4, 1, 4, -2, -2, 1, 1, 6, -9, 3, 5, 0, -9, 6, -1, 1, 10, -15, 3, 3, -1, 6, 5, -24, 18, -4, 1, 15, -20, -6, 18, -8, 1, 7, 14, -49, 36, -4, -4, 1, 1, 21, -21, -35, 60, -30, 5, 8, 28, -84, 50, 20, -30, 10, -1, 1, 28, -14 (list; graph; listen)
OFFSET

0,4

COMMENT

The g.f. of column k of array A027907(n,k) (trinomial coefficients) is (x^(ceiling(k/2)))*N3(k,x)/(1-x)^(k+1).

The sequence of degrees for the polynomials N3(n,x) is [0, 0, 0, 1, 2, 1, 3, 3, 3, 4, 5, 4, 6, 6, 6,...] for n >= 0.

Row sums N3(n,1)=1 for all n.

FORMULA

a(n, m) = [x^m]N3(n, x), n, m >= 0, with N3(n, x)= sum(((1-x)^(j-1))*(x^(b(c(n), j)))*N3(n-j, x), j=1..2), N3(n, x)= 1 for n=0, 1 and b(c(n), j) := 1 if 1<= j <= c(n) else 0, with c(n) := 1 if mod(n, 2)=0 else c(n) := mod(n, 2)-1; (hence b(0, j)=0, j=1..2).

EXAMPLE

{1}; {1}; {1}; {2,-1}; {1,1,-1}; {3,-2}; {1,3,-4,1}; {4,-2,-2,1}; ...

c=1: b(1,1)=1, b(1,2)=0.

N3(7,x)=4-2*x-2*x^2+5*x^3.

CROSSREFS

Sequence in context: A118914 A124010 A133364 this_sequence A029385 A026536 A046213

Adjacent sequences: A063417 A063418 A063419 this_sequence A063421 A063422 A063423

KEYWORD

sign,easy,tabf

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Jul 27 2001

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research