login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073402 Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n>=0, (generalized (1,2)-Fibonacci). Companion triangle is A073401. 2
2, 33, 9, 831, 396, 45, 28236, 18297, 3744, 243, 1210140, 968679, 273483, 32481, 1377, 62686440, 58920534, 20681811, 3418767, 268029, 8019, 3810867480, 4075425738, 1683064737, 347584284, 38186478 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

The row polynomials are q(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 p(k,n) := sum(b(k,m)*n^m,m=0..k), k >= 0, are the row polynomials of triangle b(k,m)= A073401(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; 33,9; 831,396,45; ... (lower triangular matrix a(k,m), k >= m >= 0, else 0).

CROSSREFS

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

Sequence in context: A128146 A012604 A012731 * A078732 A042251 A199551

Adjacent sequences:  A073399 A073400 A073401 * A073403 A073404 A073405

KEYWORD

nonn,easy,tabl

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.