Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073401
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073401 Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n>=0, (generalized (1,2)-Fibonacci). Companion triangle is A073402. +0
4
1, 30, 9, 1050, 531, 63, 44520, 29610, 6165, 405, 2245320, 1789614, 502821, 59454, 2511, 131891760, 120133692, 41182344, 6686631, 517104, 15309, 8862693840, 8966770308, 3559509360, 714174327 (list; table; graph; listen)
OFFSET

0,2

COMMENT

The row polynomials are p(k,x) := sum(a(k,m)*x^m,m=0..k), k=0,1,2,...

The k-th convolution of U0(n) := A001045(n+1), n>= 0, ((1,2) Fibonacci numbers starting with U0(0)=1) with itself is Uk(n) := A073370(n+k,k) = (p(k-1,n)*(n+1)*U0(n+1) + q(k-1,n)*(n+2)*2*U0(n))/(k!*9^k)), k=1,2,..., where the companion polynomials q(k,n) := sum(b(k,m)*n^m,m=0..k), k >= 0, are the row polynomials of triangle b(k,m)= A073402(k,m).

LINKS

W. Lang First 7 rows .

FORMULA

Recursion for row polynomials defined in the comments: p(k, n)= (n+2)*p(k-1, n+1)+4*(n+2*(k+1))*p(k-1, n)+2*(n+3)*q(k-1, n); q(k, n)= (n+1)*p(k-1, n+1)+4*(n+2*(k+1))*q(k-1, n), k >= 1.

EXAMPLE

k=2: U2(n)=((30+9*n)*(n+1)*U0(n+1)+(33+9*n)*(n+2)*2*U0(n))/(2*9^2), cf. A073372.

1; 30,9; 1050,531,63; ... (lower triangular matrix a(k,m), k >= m >= 0, else 0).

CROSSREFS

Cf. A001045, A073370, A073399, A073372, A073402, A073400.

Sequence in context: A040879 A040877 A040876 this_sequence A040875 A131773 A091746

Adjacent sequences: A073398 A073399 A073400 this_sequence A073402 A073403 A073404

KEYWORD

nonn,easy,tabl

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Aug 2, 2002

page 1

Search completed in 0.004 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