cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073406 Coefficient triangle of polynomials (rising powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073405.

Original entry on oeis.org

2, 36, 12, 1056, 672, 96, 43968, 40416, 10752, 864, 2396160, 2815488, 1051776, 156672, 8064, 161879040, 226492416, 105981696, 22125312, 2121984, 76032, 13044326400, 20766633984, 11446769664, 2995605504
Offset: 0

Views

Author

Wolfdieter Lang, Aug 02 2002

Keywords

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) := A002605(n), n>= 0, ((2,2) Fibonacci numbers starting with U0(0)=1) with itself is Uk(n) := A073387(n+k,k) = 2*(p(k-1,n)*(n+1)*U0(n+1) + q(k-1,n)*(n+2)*U0(n))/(k!*12^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)= A073405(k,m).

Examples

			k=2: U2(n)=2*((36+12*n)*(n+1)*U0(n+1)+(36+12*n)*(n+2)*U0(n))/(2!*12^2), cf. A073389.
2; 36,12; 1056,672,96; ... (lower triangular matrix a(k,m), k >= m >= 0, else 0).
		

Crossrefs

Formula

Recursion for row polynomials defined in the comments: p(k, n)= 2*((n+2)*p(k-1, n+1)+2*(n+2*(k+1))*p(k-1, n)+(n+3)*q(k-1, n+1)); q(k, n)= 4*((n+1)*p(k-1, n+1)+(n+2*(k+1))*q(k-1, n)), k >= 1. [Corrected by Sean A. Irvine, Nov 25 2024]