Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049324
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049324 A convolution triangle of numbers generalizing Pascal's triangle A007318. +0
5
1, 3, 1, 3, 6, 1, 0, 15, 9, 1, 0, 18, 36, 12, 1, 0, 9, 81, 66, 15, 1, 0, 0, 108, 216, 105, 18, 1, 0, 0, 81, 459, 450, 153, 21, 1, 0, 0, 27, 648, 1305, 810, 210, 24, 1, 0, 0, 0, 594, 2673, 2970, 1323, 276, 27, 1, 0, 0, 0, 324, 3915, 7938 (list; table; graph; listen)
OFFSET

1,2

LINKS

W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.

FORMULA

a(n, m) = 3*(3*m-n+1)*a(n-1, m)/n + m*a(n-1, m-1)/n, n >= m >= 1; a(n, m) := 0, n<m; a(n, 0) := 0; a(1, 1)=1. G.f. for m-th column: (x*p(2, x))^m, p(2, x) := 1+3*x+3*x^2 (row polynomial of A033842(2, m)).

EXAMPLE

{1}; {3,1}; {3,6,1}; {0,15,9,1}; {0,18,36,12,1}; ...

CROSSREFS

a(n, m) := s1(-2, n, m), a member of a sequence of triangles including s1(0, n, m)= A023531(n, m) (unit matrix) and s1(2, n, m)=A007318(n-1, m-1) (Pascal's triangle). s1(-1, n, m)= A030528.

Cf. A049348, A049404.

Sequence in context: A050820 A133179 A146908 this_sequence A131111 A128549 A055885

Adjacent sequences: A049321 A049322 A049323 this_sequence A049325 A049326 A049327

KEYWORD

easy,nonn,tabl

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research