Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063422
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063422 Coefficient array for certain numerator polynomials N5(n,x), n >= 0 (rising powers of x) used for quintinomials (also called pentanomials). +0
6
1, 1, 1, 1, 1, 4, -6, 4, -1, 3, -2, -2, 3, -1, 2, 2, -8, 7, -2, 1, 6, -14, 11, -3, 10, -20, 15, -4, 6, 2, -37, 65, -56, 28, -8, 1, 3, 16, -61, 78, -42, 0, 12, -6, 1, 1, 22, -57, 35, 42, -84, 60, -21, 3, 20, -25, -64, 196, -224, 136, -44, 6, 10, 35, -219, 420 (list; graph; listen)
OFFSET

0,6

COMMENT

The g.f. of column k of array A035343(n,k) (quintinomial coefficients) is (x^(ceiling(k/4)))*N5(k,x)/(1-x)^(k+1).

The sequence of degrees for the polynomials N5(n,x) is [0, 0, 0, 0, 0, 3, 4, 4, 4, 3, 7, 8, 8, 7, 7,...] for n >= 0.

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

FORMULA

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

EXAMPLE

{1}; {1}; {1}; {1}; {1}; {4,-6,4,-1}; {3,-2,-2,3,-1}; {2,2,-8,7,-2}; {1,6,-14,11,-3}; ...

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

N5(6,x)=3-2*x-2*x^2+3*x^3-x^4.

CROSSREFS

Adjacent sequences: A063419 A063420 A063421 this_sequence A063423 A063424 A063425

Sequence in context: A023901 A087108 A021687 this_sequence A010670 A131890 A062751

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research