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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060922 Convolution triangle for Lucas numbers A000032(n+1), n >= 0. 11
1, 3, 1, 4, 6, 1, 7, 17, 9, 1, 11, 38, 39, 12, 1, 18, 80, 120, 70, 15, 1, 29, 158, 315, 280, 110, 18, 1, 47, 303, 753, 905, 545, 159, 21, 1, 76, 566, 1687, 2568, 2120, 942, 217, 24, 1, 123, 1039, 3612, 6666, 7043, 4311 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

In the language of Shapiro et al. (see A053121 for the reference) such a lower triangular (ordinary) convolution array, considered as a matrix, belongs to the Bell-subgroup of the Riordan-group. G.f. for row polynomials p(n,x) := sum(a(n,m)*x^m,m=0..n) is (1+2*z)/(1-(1+x)*z-(1+2*x)*z^2).

Row sums give A060925. Column sequences (without leading zeros) are, for m=0..6: A000032(n+1)= A000204(n+1) (Lucas), A004799(n+1), A060929-33.

Bisection of this triangle gives triangles A060923 (even part) and A060924 (odd part).

For the m-th column sequence (without leading zeros) one has: a(n+m,m)= (pL1(m,n)*L(n+2)+pL2(m,n)*L(n+1))/(m!*5^m), m >= 0, with the Lucas numbers L(n)=A000032(n), n >= 0 and the row polynomials pL1(n,x) := sum(A061188(n,m)*x^n,m=0..n) and pL2(n,x) := sum(A061189(n,m)*x^m,m=0..n).

FORMULA

a(n, m)=((n-m+1)*a(n, m-1)+2*(2*n-m)*a(n-1, m-1)+4*(n-1)*a(n-2, m-1))/(5*m), n >= m >= 1, a(n, 0)= A000204(n+1)= A000032(n+1).

G.f. for m-th column: ((1+2*x)/(1-x-x^2))* ((x*(1+2*x))/(1-x-x^2))^m.

EXAMPLE

{1}; {3,1}; {4,6,1}; ...; p(2,x) = 4+6*x+x^2.

CROSSREFS

Sequence in context: A080851 A108285 A075419 * A143790 A135611 A199372

Adjacent sequences:  A060919 A060920 A060921 * A060923 A060924 A060925

KEYWORD

nonn,easy,tabl

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Apr 20 2001

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 15 16:28 EST 2012. Contains 205823 sequences.