Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073400
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073400 Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n>=0, (generalized (1,2)-Fibonacci). Companion triangle is A073399. +0
7
2, 9, 33, 45, 396, 831, 243, 3744, 18297, 28236, 1377, 32481, 273483, 968679, 1210140, 8019, 268029, 3418767, 20681811, 58920534, 62686440, 47385, 2130138, 38186478, 347584284, 1683064737, 4075425738 (list; table; graph; listen)
OFFSET

0,1

COMMENT

The row polynomials are q(k,x) := sum(a(k,m)*x^(k-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^(k-m),m=0..k) are the row polynomials of triangle b(k,m)= A073399(k,m).

LINKS

W. Lang First 7 rows .

FORMULA

Recursion for row polynomials defined in the comments: see A073401.

EXAMPLE

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

1; 9,33; 45,396,831; ... (lower triangular matrix a(k,m), k >= m >= 0, else 0).

CROSSREFS

Cf. A001045, A073370, A073399, A073401.

Sequence in context: A139628 A123142 A122097 this_sequence A048498 A150921 A150922

Adjacent sequences: A073397 A073398 A073399 this_sequence A073401 A073402 A073403

KEYWORD

nonn,easy,tabl

AUTHOR

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

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 December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research