A035009 -id:A035009 - cp's OEIS frontend

A001861 Expansion of e.g.f. exp(2*(exp(x) - 1)).

1, 2, 6, 22, 94, 454, 2430, 14214, 89918, 610182, 4412798, 33827974, 273646526, 2326980998, 20732504062, 192982729350, 1871953992254, 18880288847750, 197601208474238, 2142184050841734, 24016181943732414, 278028611833689478, 3319156078802044158, 40811417293301014150

Offset: 0

N. J. A. Sloane, Simon Plouffe

Values of Bell polynomials: ways of placing n labeled balls into n unlabeled (but 2-colored) boxes.
First column of the square of the matrix exp(P)/exp(1) given in A011971. - Gottfried Helms, Mar 30 2007
Base matrix in A011971, second power in A078937, third power in A078938, fourth power in A078939. - Gottfried Helms, Apr 08 2007
Equals row sums of triangle A144061. - Gary W. Adamson, Sep 09 2008
Equals eigensequence of triangle A109128. - Gary W. Adamson, Apr 17 2009
Hankel transform is A108400. - Paul Barry, Apr 29 2009
The number of ways of putting n labeled balls into a set of bags and then putting the bags into 2 labeled boxes. An example is given below. - Peter Bala, Mar 23 2013
The f-vectors of n-dimensional hypercube are given by A038207 = exp[M*B(.,2)] = exp[M*A001861(.)] where M = A238385-I and (B(.,x))^n = B(n,x) are the Bell polynomials (cf. A008277). - Tom Copeland, Apr 17 2014
Moments of the Poisson distribution with mean 2. - Vladimir Reshetnikov, May 17 2016
Exponential self-convolution of Bell numbers (A000110). - Vladimir Reshetnikov, Oct 06 2016

			a(2) = 6: The six ways of putting 2 balls into bags (denoted by { }) and then into 2 labeled boxes (denoted by [ ]) are
01: [{1,2}] [ ];
02: [ ] [{1,2}];
03: [{1}] [{2}];
04: [{2}] [{1}];
05: [{1} {2}] [ ];
06: [ ] [{1} {2}].
- _Peter Bala_, Mar 23 2013

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..558 (terms 0..100 from T. D. Noe)
M. Aigner, A characterization of the Bell numbers, Discr. Math., 205 (1999), 207-210.
Michael Anshelevich, Product formulas on posets, Wick products, and a correction for the q-Poisson process, arXiv:1708.08034 [math.OA], 2017, See Proposition 34 p. 25.
Diego Arcis, Camilo González, and Sebastián Márquez, Symmetric functions in noncommuting variables in superspace, arXiv:2312.00574 [math.CO], 2023.
C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, Generating Functions for Generating Trees, Discrete Mathematics 246(1-3), March 2002, pp. 29-55.
J. M. Borwein, Adventures with the OEIS: Five sequences Tony may like, Guttmann 70th [Birthday] Meeting, 2015, revised May 2016.
J. M. Borwein, Adventures with the OEIS: Five sequences Tony may like, Guttmann 70th [Birthday] Meeting, 2015, revised May 2016. [Cached copy, with permission]
Jacques Carlier and Corinne Lucet, A decomposition algorithm for network reliability evaluation. In First International Colloquium on Graphs and Optimization (GOI), 1992 (Grimentz). Discrete Appl. Math. 65 (1996), 141-156 (see page 152 and Fig 6).
Adam M. Goyt and Lara K. Pudwell, Avoiding colored partitions of two elements in the pattern sense, arXiv preprint arXiv:1203.3786 [math.CO], 2012. - From _N. J. A. Sloane_, Sep 17 2012
Wan-Ming Guo and Lily Li Liu, Asymptotic normality of the Stirling-Whitney-Riordan triangle, Filomat (2023) Vol. 37, No. 9, 2923-2934.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 66 [broken link?]
Marin Knežević, Vedran Krčadinac, and Lucija Relić, Matrix products of binomial coefficients and unsigned Stirling numbers, arXiv:2012.15307 [math.CO], 2020.
G. Labelle et al., Stirling numbers interpolation using permutations with forbidden subsequences, Discrete Math. 246 (2002), 177-195.
Huyile Liang, Jeffrey Remmel, and Sainan Zheng, Stieltjes moment sequences of polynomials, arXiv:1710.05795 [math.CO], 2017, see page 20.
T. Mansour, M. Shattuck and D. G. L. Wang, Recurrence relations for patterns of type (2, 1) in flattened permutations, arXiv preprint arXiv:1306.3355 [math.CO], 2013.
Victor Meally, Comparison of several sequences given in Motzkin's paper "Sorting numbers for cylinders...", letter to N. J. A. Sloane, N. D.
T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. [Annotated, scanned copy]
OEIS Wiki, Sorting numbers
J. Riordan, Letter to N. J. A. Sloane, Oct. 1970
J. Riordan, Letter, Oct 31 1977
Frank Simon, Algebraic Methods for Computing the Reliability of Networks, Dissertation, Doctor Rerum Naturalium (Dr. rer. nat.), Fakultät Mathematik und Naturwissenschaften der Technischen Universität Dresden, 2012. See Table 5.1. - From _N. J. A. Sloane_, Jan 04 2013
Amit Kumar Singh, Akash Kumar and Thambipillai Srikanthan, Accelerating Throughput-aware Run-time Mapping for Heterogeneous MPSoCs, ACM Transactions on Design Automation of Electronic Systems, 2012. - From _N. J. A. Sloane_, Dec 24 2012
Jacob Sprittulla, On Colored Factorizations, arXiv:2008.09984 [math.CO], 2020.

For boxes of 1 color, see A000110, for 3 colors see A027710, for 4 colors see A078944, for 5 colors see A144180, for 6 colors see A144223, for 7 colors see A144263, for 8 colors see A221159.
First column of A078937.
Equals 2*A035009(n), n>0.
Row sums of A033306, A036073, A049020, and A144061.
Cf. A000110, A000587, A002871, A027710, A056857, A068199, A068200, A068201, A078937, A078938, A078944, A078945, A109128, A129323, A129324, A129325, A129327, A129328, A129329, A129331, A129332, A129333, A144180, A144223, A144263, A189233, A213170, A221159, A221176.

[&+[2^k*StirlingSecond(n, k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, May 18 2019

A001861:=n->add(Stirling2(n,k)*2^k, k=0..n); seq(A001861(n), n=0..20); # Wesley Ivan Hurt, Apr 18 2014
# second Maple program:
b:= proc(n, m) option remember;
     `if`(n=0, 2^m, m*b(n-1, m)+b(n-1, m+1))
    end:
a:= n-> b(n, 0):
seq(a(n), n=0..25);  # Alois P. Heinz, Aug 04 2021

Table[Sum[StirlingS2[n, k]*2^k, {k, 0, n}], {n, 0, 21}] (* Geoffrey Critzer, Oct 06 2009 *)
mx = 16; p = 1; Range[0, mx]! CoefficientList[ Series[ Exp[ (Exp[p*x] - p - 1)/p + Exp[x]], {x, 0, mx}], x] (* Robert G. Wilson v, Dec 12 2012 *)
Table[BellB[n, 2], {n, 0, 20}] (* Vaclav Kotesovec, Jan 06 2013 *)

a(n)=if(n<0,0,n!*polcoeff(exp(2*(exp(x+x*O(x^n))-1)),n))

{a(n)=polcoeff(sum(m=0, n, 2^m*x^m/prod(k=1,m,1-k*x +x*O(x^n))), n)} /* Paul D. Hanna, Feb 15 2012 */

{a(n) = sum(k=0, n, 2^k*stirling(n, k, 2))} \\ Seiichi Manyama, Jul 28 2019

expnums(30, 2) # Zerinvary Lajos, Jun 26 2008

a(n) = Sum_{k=0..n} 2^k*Stirling2(n, k). - Emeric Deutsch, Oct 20 2001
a(n) = exp(-2)*Sum_{k>=1} 2^k*k^n/k!. - Benoit Cloitre, Sep 25 2003
G.f. satisfies 2*(x/(1-x))*A(x/(1-x)) = A(x) - 1; twice the binomial transform equals the sequence shifted one place left. - Paul D. Hanna, Dec 08 2003
PE = exp(matpascal(5)-matid(6)); A = PE^2; a(n)=A[n,1]. - Gottfried Helms, Apr 08 2007
G.f.: 1/(1-2x-2x^2/(1-3x-4x^2/(1-4x-6x^2/(1-5x-8x^2/(1-6x-10x^2/(1-... (continued fraction). - Paul Barry, Apr 29 2009
O.g.f.: Sum_{n>=0} 2^n*x^n / Product_{k=1..n} (1-k*x). - Paul D. Hanna, Feb 15 2012
a(n) ~ exp(-2-n+n/LambertW(n/2))*n^n/LambertW(n/2)^(n+1/2). - Vaclav Kotesovec, Jan 06 2013
G.f.: (G(0) - 1)/(x-1)/2 where G(k) = 1 - 2/(1-k*x)/(1-x/(x-1/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jan 16 2013
G.f.: 1/Q(0) where Q(k) =  1 + x*k - x - x/(1 - 2*x*(k+1)/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Mar 07 2013
G.f.: ((1+x)/Q(0)-1)/(2*x), where Q(k) = 1 - (k+1)*x - 2*(k+1)*x^2/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 03 2013
G.f.: T(0)/(1-2*x), where T(k) = 1 - 2*x^2*(k+1)/( 2*x^2*(k+1) - (1-2*x-x*k)*(1-3*x-x*k)/T(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Oct 24 2013
a(n) = Sum_{k=0..n} A033306(n,k) = Sum_{k=0..n} binomial(n,k)*Bell(k)*Bell(n-k), where Bell = A000110 (see Motzkin, p. 170). - Danny Rorabaugh, Oct 18 2015
a(0) = 1 and a(n) = 2 * Sum_{k=0..n-1} binomial(n-1,k)*a(k) for n > 0. - Seiichi Manyama, Sep 25 2017 [corrected by Ilya Gutkovskiy, Jul 12 2020]

A078945 Row sums of A078939.

Original entry on oeis.org

1, 5, 29, 189, 1357, 10589, 88909, 797085, 7583373, 76179037, 804638925, 8904557341, 102929260813, 1239432543709, 15511264432973, 201330839371421, 2705249923950477, 37567754666530141, 538369104335121869

Offset: 0

Paul D. Hanna, Dec 18 2002

nonn

Equals A078944(n+1)/4.

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Column k=4 of A335975.

Cf. A078939, A078944, A000110, A035009, A078940.

A078945 := proc(n) local a,b,i;
a := [seq(2,i=1..n)]; b := [seq(1,i=1..n)];
exp(-x)*hypergeom(a,b,x); round(evalf(subs(x=4,%),66)) end:
seq(A078945(n),n=0..18); # Peter Luschny, Mar 30 2011

Table[n!, {n, 0, 20}]CoefficientList[Series[E^(4E^x-4+x), {x, 0, 20}], x]
Table[1/E^4/4*Sum[m^n/m!*4^m,{m,0,Infinity}],{n,1,20}] (* Vaclav Kotesovec, Mar 12 2014 *)
Table[BellB[n+1, 4]/4, {n, 0, 20}] (* Vaclav Kotesovec, Jun 26 2022 *)

E.g.f.: exp(4*(exp(x)-1)+x).
Stirling transform of [1, 4, 4^2, 4^3, ...]. - Gerald McGarvey, Jun 01 2005
Define f_1(x), f_2(x), ... such that f_1(x)=e^x, f_{n+1}(x) = (d/dx)(x*f_n(x)), for n=2,3,.... Then a(n)=e^{-4}*f_n(4). - Milan Janjic, May 30 2008
G.f.: 1/(Q(0) - 4*x) where Q(k) =  1 - x*(k+1)/( 1 - 4*x/Q(k+1) ); (continued fraction ). - Sergei N. Gladkovskii, Mar 22 2013
G.f.: T(0)/(1-5*x), where T(k) = 1 - 4*x^2*(k+1)/( 4*x^2*(k+1) - (1-5*x-x*k)*(1-6*x-x*k)/T(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Oct 28 2013
a(n) = exp(-4) * Sum_{k>=0} (k + 1)^n * 4^k / k!. - Ilya Gutkovskiy, Apr 20 2020
a(n) ~ n^(n+1) * exp(n/LambertW(n/4) - n - 4) / (4 * sqrt(1 + LambertW(n/4)) * LambertW(n/4)^(n+1)). - Vaclav Kotesovec, Jun 26 2022
a(0) = 1; a(n) = a(n-1) + 4 * Sum_{k=1..n} binomial(n-1,k-1) * a(n-k). - Seiichi Manyama, Dec 05 2023

More terms from Robert G. Wilson v, Dec 19 2002

A078937 Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).

Original entry on oeis.org

1, 2, 1, 6, 4, 1, 22, 18, 6, 1, 94, 88, 36, 8, 1, 454, 470, 220, 60, 10, 1, 2430, 2724, 1410, 440, 90, 12, 1, 14214, 17010, 9534, 3290, 770, 126, 14, 1, 89918, 113712, 68040, 25424, 6580, 1232, 168, 16, 1, 610182, 809262, 511704, 204120, 57204, 11844, 1848, 216, 18, 1

Offset: 0

Paul D. Hanna, Dec 18 2002

First column gives A001861 (values of Bell polynomials); row sums gives A035009 (STIRLING transform of powers of 2);
Square of the matrix exp(P)/exp(1) given in A011971. - Gottfried Helms, Apr 08 2007. Base matrix in A011971 and in A056857, second power in this entry, third power in A078938, fourth power in A078939
Riordan array [exp(2*exp(x)-2),x], whose production matrix has e.g.f. exp(x*t)(t+2*exp(x)). [Paul Barry, Nov 26 2008]

			[0] 1;
[1] 2, 1;
[2] 6, 4, 1;
[3] 22, 18, 6, 1;
[4] 94, 88, 36, 8, 1;
[5] 454, 470, 220, 60, 10, 1;
[6] 2430, 2724, 1410, 440, 90, 12, 1;
[7] 14214, 17010, 9534, 3290, 770, 126, 14, 1;
[8] 89918, 113712, 68040, 25424, 6580, 1232, 168, 16, 1;

Cf. A056857, A001861, A035009.
Cf. A078938, A078944, A078945, A000110.
Cf. A078937, A078938, A129323, A129324, A129325, A027710.
Cf. A129327, A129328, A129329, A078944, A129331, A129332, A129333.

# Computes triangle as a matrix M(dim, p).
# A023531 (p=0), A056857 (p=1), this sequence (p=2), A078938 (p=3), ...
with(LinearAlgebra): M := (n, p) -> local j,k; MatrixPower(subs(exp(1) = 1,
MatrixExponential(MatrixExponential(Matrix(n, n, [seq(seq(`if`(j = k + 1, j, 0),
k = 0..n-1), j = 0..n-1)])))), p): M(8, 2);  # Peter Luschny, Mar 28 2024

k=9; m=matpascal(k)-matid(k+1); pe=matid(k+1)+sum(j=1,k,m^j/j!); A=pe^2; A /* Gottfried Helms, Apr 08 2007; amended by Georg Fischer Mar 28 2024 */

PE=exp(matpascal(5))/exp(1); A = PE^2; a(n)=A[n,column] with exact integer arithmetic: PE=exp(matpascal(5)-matid(6)); A = PE^2; a(n)=A[n,1] - Gottfried Helms, Apr 08 2007

Exponential function of 2*Pascal's triangle (taken as a lower triangular matrix) divided by e^2: [A078937] = (1/e^2)*exp(2*[A007318]) = [A056857]^2.

Entry revised by N. J. A. Sloane, Apr 25 2007

a(38) corrected by Georg Fischer, Mar 28 2024

A078940 Row sums of A078938.

Original entry on oeis.org

1, 4, 19, 103, 622, 4117, 29521, 227290, 1865881, 16239523, 149142952, 1439618143, 14555631781, 153700654036, 1690684883191, 19328770917499, 229203640111870, 2814018686591089, 35711716110387589, 467766675528462562

Offset: 0

Paul D. Hanna, Dec 18 2002

nonn

Divide by 3^n and insert an initial 1 to get sequence that shifts left one place under 1/3 order binomial transformation. - Franklin T. Adams-Watters, Jul 13 2006

Binomial transform of A027710. - Vaclav Kotesovec, Jun 26 2022

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Column k=3 of A335975.

Cf. A027710, A035009, A078938, A078945, A355254.

A078940 := proc(n) local a,b,i;
a := [seq(2,i=1..n)]; b := [seq(1,i=1..n)];
exp(-x)*hypergeom(a,b,x); round(evalf(subs(x=3,%),66)) end:
seq(A078940(n),n=0..19); # Peter Luschny, Mar 30 2011

Table[n!, {n, 0, 20}]CoefficientList[Series[E^(3E^x-3+x), {x, 0, 20}], x]
Table[1/E^3/3*Sum[m^n/m!*3^m,{m,0,Infinity}],{n,1,20}] (* Vaclav Kotesovec, Mar 12 2014 *)
Table[BellB[n+1, 3]/3, {n, 0, 20}] (* Vaclav Kotesovec, Jan 15 2016 *)
nmax = 20; Clear[g]; g[nmax+1] = 1; g[k_] := g[k] = 1 - (k+4)*x - 3*(k+1)*x^2/g[k+1]; CoefficientList[Series[1/g[0], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jan 15 2016, after Sergei N. Gladkovskii *)

E.g.f.: exp(3*(exp(x)-1)+x).
Stirling transform of [1, 3, 3^2, 3^3, ...]. - Gerald McGarvey, Jun 01 2005
Define f_1(x), f_2(x), ... such that f_1(x)=e^x, f_{n+1}(x) = (d/dx)(x*f_n(x)), for n=2,3,.... Then a(n)=e^{-3}*f_n(3). - Milan Janjic, May 30 2008
G.f.: 1/T(0), where T(k) = 1 - (k+4)*x - 3*(k+1)*x^2/T(k+1); (continued fraction). - Sergei N. Gladkovskii, Jan 15 2016
a(n) = exp(-3) * Sum_{k>=0} (k + 1)^n * 3^k / k!. - Ilya Gutkovskiy, Apr 20 2020
a(n) ~ n^(n+1) * exp(n/LambertW(n/3) - n - 3) / (3 * sqrt(1 + LambertW(n/3)) * LambertW(n/3)^(n+1)). - Vaclav Kotesovec, Jun 26 2022
a(0) = 1; a(n) = a(n-1) + 3 * Sum_{k=1..n} binomial(n-1,k-1) * a(n-k). - Seiichi Manyama, Dec 05 2023

More terms from Robert G. Wilson v, Dec 19 2002

A108400 a(n) = Product_{k = 0..n} (2^k * k!).

Original entry on oeis.org

1, 2, 16, 768, 294912, 1132462080, 52183852646400, 33664847019245568000, 347485857744891213250560000, 64560982045934655213753964953600000, 239901585047846581083822477336190648320000000

Offset: 0

Philippe Deléham, Jul 02 2005

Hankel transform (see A001906 for definition) of the sequences A000898, A001861, A035009(with first term omitted), A047974, A067147(unsigned version), A083886.
Hankel transform of the sequence with e.g.f. exp(x^2). Also (-1)^C(n+1,2)*a(n) is the Hankel transform of the sequence with e.g.f. exp(-x^2). - Paul Barry, Feb 12 2008
Let T(n,k) = (n+1)^k * (1+(-1)^(n-k))/2, then a(n) = det(T(i,j); 0<=i, j<=n). - Paul Barry, Feb 12 2008

G. C. Greubel, Table of n, a(n) for n = 0..38
M. E. Larsen, Wronskian Harmony, Mathematics Magazine, vol. 63, no. 1, 1990, pp. 33-37.
J. W. Layman, The Hankel Transform and Some of its Properties, J. Integer Sequences, 4 (2001), #01.1.5.

Cf. A000178, A006125, A074962.

Cf. A000898, A001861, A001906, A035009, A047974, A067147, A083886.

BarnesG:= func< n | (&*[Factorial(j): j in [0..n-2]]) >;
[2^Binomial(n+1,2)*BarnesG(n+2): n in [0..15]]; // G. C. Greubel, Jun 21 2022

Table[Product[k!*2^k, {k,0,n}], {n,0,10}] (* Vaclav Kotesovec, Nov 14 2014 *)
Table[2^Binomial[n+1,2]*BarnesG[n+2], {n,0,15}] (* G. C. Greubel, Jun 21 2022 *)

def barnes_g(n): return product(factorial(j) for j in (0..n-2))
[2^binomial(n+1,2)*barnes_g(n+2) for n in (0..15)] # G. C. Greubel, Jun 21 2022

a(n) = A006125(n+1)*A000178(n).
a(n) = Product_{i=1..n} Product_{j=0..i-1} {2*(i-j)}. - Paul Barry, Aug 02 2008
a(n) ~ 2^((n+1)^2/2) * n^(n^2/2+n+5/12) * Pi^((n+1)/2) / (A * exp(3*n^2/4+n-1/12)), where A = 1.2824271291... is the Glaisher-Kinkelin constant (see A074962). - Vaclav Kotesovec, Nov 14 2014

A343523 a(0) = 1; a(n) = 2 * Sum_{k=1..n} binomial(n,k) * a(k-1).

Original entry on oeis.org

1, 2, 8, 34, 164, 878, 5136, 32490, 220476, 1594470, 12223016, 98876322, 840804820, 7491247006, 69730182720, 676390547034, 6821988655468, 71398971351510, 774032400213336, 8677733804696594, 100459693769214980, 1199306075189097230, 14746332963835756400, 186534818943430728906

Offset: 0

Ilya Gutkovskiy, Jun 07 2021

nonn

Georg Fischer, Table of n, a(n) for n = 0..400

Cf. A001861, A004123, A035009, A040027, A343975, A344735, A344840, A345077, A345078, A345081.

a[0] = 1; a[n_] := a[n] = 2 Sum[Binomial[n, k] a[k - 1], {k, 1, n}]; Table[a[n], {n, 0, 23}]
nmax = 23; A[] = 0; Do[A[x] = 1 + 2 x A[x/(1 - x)]/(1 - x)^2 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

G.f. A(x) satisfies: A(x) = 1 + 2 * x * A(x/(1 - x)) / (1 - x)^2.

A126350 Triangle read by rows: matrix product of the binomial coefficients with the Stirling numbers of the second kind.

Original entry on oeis.org

1, 1, 2, 1, 5, 5, 1, 9, 22, 15, 1, 14, 61, 99, 52, 1, 20, 135, 385, 471, 203, 1, 27, 260, 1140, 2416, 2386, 877, 1, 35, 455, 2835, 9156, 15470, 12867, 4140, 1, 44, 742, 6230, 28441, 72590, 102215, 73681, 21147

Offset: 1

Thomas Wieder, Dec 29 2006

Many well-known integer sequences arise from such a matrix product of combinatorial coefficients. In the present case we have as the first row (not surprisingly) A000110 = Bell or exponential numbers: ways of placing n labeled balls into n indistinguishable boxes . As second row we have A033452 = "STIRLING" transform of squares A000290. As the column sums we have 1, 3, 11, 47, 227, 1215, 7107, 44959, 305091 which is A035009 = STIRLING transform of [1,1,2,4,8,16,32, ...].

			Matrix begins:
1 2 5 15 52 203  877  4140  21147
0 1 5 22 99 471 2386 12867  73681
0 0 1  9 61 385 2416 15470 102215
0 0 0  1 14 135 1140  9156  72590
0 0 0  0 1   20  260  2835  28441
0 0 0  0 0    1   27   455   6230
0 0 0  0 0    0    1    35    742
0 0 0  0 0    0    0     1     44
0 0 0  0 0    0    0     0      1

Cf. A039810, A039814, A126351, A054654, A126353.

Cf. A137597.

T:= (n, k)-> add(Stirling2(n, j)*binomial(j-1, n-k), j=n-k+1..n):
seq(seq(T(n, k), k=1..n), n=1..10);  # Alois P. Heinz, Sep 03 2019

T[dim_] := T[dim] = Module[{M}, M[n_, n_] = 1; M[, ] = 0; Do[M[n, k] = M[n-1, k-1] + (k+2) M[n-1, k] + (k+1) M[n-1, k+1], {n, 0, dim-1}, {k, 0, n-1}]; Array[M, {dim, dim}, {0, 0}]];
dim = 9;
Table[T[dim][[n]][[1 ;; n]] // Reverse, {n, 1, dim}] (* Jean-François Alcover, Jun 27 2019, from Sage *)

def A126350_triangle(dim): # rows in reversed order
    M = matrix(ZZ,dim,dim)
    for n in (0..dim-1): M[n,n] = 1
    for n in (1..dim-1):
        for k in (0..n-1):
            M[n,k] = M[n-1,k-1]+(k+2)*M[n-1,k]+(k+1)*M[n-1,k+1]
    return M
A126350_triangle(9) # Peter Luschny, Sep 19 2012

(In Maple notation:) Matrix product A.B of matrix A[i,j]:=binomial(j-1,i-1) with i = 1 to p+1, j = 1 to p+1, p=8 and of matrix B[i,j]:=stirling2(j,i) with i from 1 to d, j from 1 to d, d=9.

cp's OEIS Frontend

A001861 Expansion of e.g.f. exp(2*(exp(x) - 1)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

Sage

Formula

A078945 Row sums of A078939.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A078937 Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

PARI

Formula

Extensions

A078940 Row sums of A078938.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A108400 a(n) = Product_{k = 0..n} (2^k * k!).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A343523 a(0) = 1; a(n) = 2 * Sum_{k=1..n} binomial(n,k) * a(k-1).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A126350 Triangle read by rows: matrix product of the binomial coefficients with the Stirling numbers of the second kind.

Views

Author

Keywords