This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A051141 Triangle read by rows: a(n, m) = S1(n, m)*3^(n-m) where S1 are the signed Stirling numbers of first kind A008275. 14
 1, -3, 1, 18, -9, 1, -162, 99, -18, 1, 1944, -1350, 315, -30, 1, -29160, 22194, -6075, 765, -45, 1, 524880, -428652, 131544, -19845, 1575, -63, 1, -11022480, 9526572, -3191076, 548289, -52920, 2898, -84, 1, 264539520, -239660208 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Previous name was: Generalized Stirling number triangle of first kind. a(n,m) = R_n^m(a=0,b=3) in the notation of the given reference. a(n,m) is a Jabotinsky matrix, i.e., the monic row polynomials E(n,x) := sum(a(n,m)*x^m,m=1..n) = product(x-3*j,j=0..n-1), n >= 1, E(0,x) := 1, are exponential convolution polynomials (see A039692 for the definition and a Knuth reference). This is the signed Stirling1 triangle with diagonals d>=0 (main diagonal d=0) scaled with 3^d. Exponential Riordan array [1/(1+3x),log(1+3x)/3]. The unsigned triangle is [1/(1-3x),log(1/(1-3x)^(1/3))]. - Paul Barry, Apr 29 2009 Also the Bell transform of the triple factorial numbers A032031 which adds a first column (1,0,0 ...) on the left side of the triangle and computes the unsigned values. For the definition of the Bell transform see A264428. See A004747 for the triple factorial numbers A008544 and A203412 for the triple factorial numbers A007559 as well as A039683 and A132062 for the case of double factorial numbers. - Peter Luschny, Dec 21 2015 LINKS G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened Richell O. Celeste, Roberto B. Corcino, Ken Joffaniel M. Gonzales, Two Approaches to Normal Order Coefficients, Journal of Integer Sequences, Vol. 20 (2017), Article 17.3.5. W. Lang, First 10 rows. D. S. Mitrinovic, M. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Pubi. Elektrotehn. Fak. Ser. Mat. Fiz. 77 (1962). FORMULA a(n, m) = a(n-1, m-1) - 3*(n-1)*a(n-1, m), n >= m >= 1; a(n, m) = 0, n= m >= 1 := a[n, m] = a[n-1, m-1] - 3(n-1)*a[n-1, m]; a[n_, m_] /; n < m = 0; a[_, 0] = 0; a[1, 1] = 1; Flatten[Table[a[n, m], {n, 1, 9}, {m, 1, n}]][[1 ;; 38]] (* Jean-François Alcover, Jun 01 2011, after formula *) Table[StirlingS1[n, m]*3^(n - m), {n, 1, 10}, {m, 1, n}]//Flatten (* G. C. Greubel, Oct 24 2017 *) PROG (Sage) # The function bell_transform is defined in A264428. triplefactorial = lambda n: 3^n*factorial(n) def A051141_row(n):     trifact = [triplefactorial(k) for k in (0..n)]     return bell_transform(n, trifact) [A051141_row(n) for n in (0..8)] # Peter Luschny, Dec 21 2015 (PARI) for(n=1, 10, for(m=1, n, print1(stirling(n, m, 1)*3^(n-m), ", "))) \\ G. C. Greubel, Oct 24 2017 CROSSREFS First (m=1) column sequence is: A032031(n-1). Row sums (signed triangle): A008544(n-1)*(-1)^(n-1). Row sums (unsigned triangle): A007559(n). Cf. A008275 (Stirling1 triangle), for b=1, A039683 for b=2. Cf. A051142. Cf. A039683, A132062, A264428. Sequence in context: A143849 A105626 A071210 * A068141 A185025 A051238 Adjacent sequences:  A051138 A051139 A051140 * A051142 A051143 A051144 KEYWORD sign,easy,tabl AUTHOR EXTENSIONS Name clarified using a formula of the author by Peter Luschny, Dec 23 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 16:33 EDT 2019. Contains 321510 sequences. (Running on oeis4.)