A008279 -id:A008279 - cp's OEIS frontend

A090657 Triangle read by rows: T(n,k) = number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly k elements (0<=k<=n).

1, 0, 1, 0, 2, 2, 0, 3, 18, 6, 0, 4, 84, 144, 24, 0, 5, 300, 1500, 1200, 120, 0, 6, 930, 10800, 23400, 10800, 720, 0, 7, 2646, 63210, 294000, 352800, 105840, 5040, 0, 8, 7112, 324576, 2857680, 7056000, 5362560, 1128960, 40320

Offset: 0

Philippe Deléham, Dec 14 2003

Another version is in A101817. - Philippe Deléham, Feb 16 2013

			Triangle begins:
  1;
  0,  1;
  0,  2,   2;
  0,  3,  18,   6;
  0,  4,  84, 144, 24;
  ...

Alois P. Heinz, Rows n = 0..62, flattened
C. M. Ringel, The Catalan combinatorics of the hereditary artin algebras, arXiv preprint arXiv:1502.06553, 2015

Row sums give: A000312. Columns k=0-2 give: A000007, A001477, A068605. Diagonal, lower diagonal give: A000142, A001804. Cf. A007318, A048993, A019538, A008279.

Cf. A101817, A288312.

T:= proc(n,k) option remember;
      if k=n then n!
    elif k=0 or k>n then 0
    else n * (T(n-1,k-1) + k/(n-k) * T(n-1,k))
      fi
    end:
seq(seq(T(n,k), k=0..n), n=0..10);

Table[Table[StirlingS2[n, k] Binomial[n, k] k!, {k, 0, n}], {n, 0,10}] // Flatten  (* Geoffrey Critzer, Sep 09 2011 *)

T(n,k) = C(n,k) * k! * A048993(n,k).
T(n,k) = A008279(n,k) * A048993(n,k).
T(n,k) = C(n,k) * A019538(n, k).
T(n,k) = C(n,k) * Sum_{j=0..k} (-1)^(k-j) * C(k,j) * j^n.
T(n,k) = n * (T(n-1,k-1) + k/(n-k) * T(n-1,k)) with T(n,n) = n! and T(n,0) = 0 for n>0.
T(2n,n) = A288312(n). - Alois P. Heinz, Jun 07 2017

Revised description from Jan Maciak, Apr 25 2004

Edited by Alois P. Heinz, Jan 17 2011

A157394 A partition product of Stirling_1 type [parameter k = 4] with biggest-part statistic (triangle read by rows).

Original entry on oeis.org

1, 1, 4, 1, 12, 12, 1, 72, 48, 24, 1, 280, 600, 120, 24, 1, 1740, 4560, 1800, 144, 0, 1, 8484, 40740, 21000, 2520, 0, 0, 1, 57232, 390432, 223440, 33600, 0, 0, 0, 1, 328752, 3811248, 2845584, 438480, 0, 0, 0, 0, 1, 2389140

Offset: 1

Peter Luschny, Mar 07 2009, Mar 14 2009

Partition product of prod_{j=0..n-2}(k-n+j+2) and n! at k = 4,
summed over parts with equal biggest part (see the Luschny link).
Underlying partition triangle is A144878.
Same partition product with length statistic is A049424.
Diagonal a(A000217(n)) = falling_factorial(4,n-1), row in A008279
Row sum is A049427.

			1
1       4
1      12       12
1      72       48       24
1     280      600      120      24
1    1740     4560     1800     144  0
1    8484    40740    21000    2520  0  0
1   57232   390432   223440   33600  0  0  0
1  328752  3811248  2845584  438480  0  0  0  0
1  2389140

Peter Luschny, Counting with Partitions.
Peter Luschny, Generalized Stirling_1 Triangles.

Cf. A157386, A157385, A157384, A157383, A157400, A157391, A157392, A157393, A157394, A157395

T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = product_{j=0..n-2}(j-n+6).

A049403 A triangle of numbers related to triangle A030528; array a(n,m), read by rows (1 <= m <= n).

Original entry on oeis.org

1, 1, 1, 0, 3, 1, 0, 3, 6, 1, 0, 0, 15, 10, 1, 0, 0, 15, 45, 15, 1, 0, 0, 0, 105, 105, 21, 1, 0, 0, 0, 105, 420, 210, 28, 1, 0, 0, 0, 0, 945, 1260, 378, 36, 1, 0, 0, 0, 0, 945, 4725, 3150, 630, 45, 1, 0, 0, 0, 0, 0, 10395, 17325, 6930, 990, 55, 1, 0, 0, 0, 0, 0, 10395, 62370

Offset: 1

Wolfdieter Lang

a(n,1) = A019590(n) = A008279(1,n). a(n,m) =: S1(-1; n,m), a member of a sequence of lower triangular Jabotinsky matrices, including S1(1; n,m) = A008275 (signed Stirling first kind), S1(2; n,m) = A008297(n,m) (signed Lah numbers). a(n,m) matrix is inverse to signed matrix ((-1)^(n-m))*A001497(n-1,m-1) (signed Bessel triangle). The monic row polynomials E(n,x) := Sum_{m=1..n} a(n,m)*x^m, E(0,x) := 1 are exponential convolution polynomials (see A039692 for the definition and a Knuth reference).

Exponential Riordan array [1+x, x(1+x/2)]. T(n,k) = A001498(k+1, n-k). - Paul Barry, Jan 15 2009

			Triangle a(n,m) (with rows n >= 1 and columns m >= 1) begins as follows:
  1;                 with row polynomial E(1,x) = x;
  1, 1;              with row polynomial E(2,x) = x^2 + x;
  0, 3,  1;          with row polynomial E(3,x) = 3*x^2 + x^3;
  0, 3,  6,   1;     with row polynomial E(4,x) = 3*x^2 + 6*x^3 + x^4;
  0, 0, 15,  10,   1;
  0, 0, 15,  45,  15,   1;
  0, 0,  0, 105, 105,  21,  1;
  0, 0,  0, 105, 420, 210, 28, 1;
  ...

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
Wolfdieter Lang, First 10 rows of the array and more.
Robert S. Maier, Boson Operator Ordering Identities from Generalized Stirling and Eulerian Numbers, arXiv:2308.10332 [math.CO], 2023. See p. 19.

Cf. A000085 (row sums), A001497, A001498, A008275, A008279, A008297, A019590, A030528, A039692.

Variations of this array: A096713, A104556, A122848, A130757.

# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> `if`(n<2,1,0), 9); # Peter Luschny, Jan 28 2016

t[n_, k_] := k!*Binomial[n, k]/((2 k - n)!*2^(n - k)); Table[ t[n, k], {n, 11}, {k, n}] // Flatten
(* Second program: *)
BellMatrix[f_Function, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len-1}, {k, 0, len-1}]];
rows = 13;
M = BellMatrix[If[#<2, 1, 0]&, rows];
Table[M[[n, k]], {n, 2, rows}, {k, 2, n}] // Flatten (* Jean-François Alcover, Jun 23 2018, after Peter Luschny *)

a(n, m) = n!*A030528(n, m)/(m!*2^(n-m)) for n >= m >= 1.
a(n, m) = (2*m-n+1)*a(n-1, m) + a(n-1, m-1) for n >= m >= 1 with a(n, m) = 0 for n < m, a(n, 0) := 0, and a(1, 1) = 1. [The 0th column does not appear in this array. - Petros Hadjicostas, Oct 28 2019]
E.g.f. for the m-th column: (x*(1 + x/2))^m/m!.
a(n,m) = A122848(n,m). - R. J. Mathar, Jan 14 2011

A090210 Triangle of certain generalized Bell numbers.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 5, 7, 1, 1, 15, 87, 34, 1, 1, 52, 1657, 2971, 209, 1, 1, 203, 43833, 513559, 163121, 1546, 1, 1, 877, 1515903, 149670844, 326922081, 12962661, 13327, 1, 1, 4140, 65766991, 66653198353, 1346634725665, 363303011071, 1395857215, 130922, 1, 1

Offset: 1

Wolfdieter Lang, Dec 01 2003

Let B_{n}(x) = sum_{j>=0}(exp(j!/(j-n)!*x-1)/j!) and
S(n,k) = k! [x^k] taylor(B_{n}(x)), where [x^k] denotes the
coefficient of x^k in the Taylor series for B_{n}(x).
Then S(n,k) (n>0, k>=0) is the square array representation of the triangle.
To illustrate the cross-references of T(n,k) when written as a square array.
n\k         A000012,A000012,A002720,A069948,A182925,A182924,...
0: A000012: 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
1: A000110: 1, 1, 2, 5, 15, 52, 203, 877, 4140, ...
2: A020556: 1, 1, 7, 87, 1657, 43833, 1515903, ...
3: A069223: 1, 1, 34, 2971, 513559, 149670844, ...
4: A071379: 1, 1, 209, 163121, 326922081, ...
5: A090209: 1, 1, 1546, 12962661, 363303011071,...
6:  ...     1, 1, 13327, 1395857215, 637056434385865,...
Note that the sequence T(0,k) is not included in the data.
- Peter Luschny, Mar 27 2011

			Triangle begins:
1;
1, 1;
2, 1, 1;
5, 7, 1, 1;
15, 87, 34, 1, 1;
52, 1657, 2971, 209, 1, 1;
203, 43833, 513559, 163121, 1546, 1, 1;

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, Phys. Lett. A 309 (2003) 198-205.
M. Schork, On the combinatorics of normal ordering bosonic operators and deforming it, J. Phys. A 36 (2003) 4651-4665.

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem.
W. Lang, First 8 rows.
K. A. Penson, P. Blasiak, A. Horzela, A. I. Solomon and G. H. E. Duchamp,Laguerre-type derivatives: Dobinski relations and combinatorial identities, J. Math. Phys. 50, 083512 (2009).

Cf. A000110, A020556, A069223, A071379, A090209, A002720, A069948, A182924, A182925, A182933.

T(n,n) gives A070227.

A090210_AsSquareArray := proc(n,k) local r,s,i;
if k=0 then 1 else r := [seq(n+1,i=1..k-1)]; s := [seq(1,i=1..k-1)];
exp(-x)*n!^(k-1)*hypergeom(r,s,x); round(evalf(subs(x=1,%),99)) fi end:
seq(lprint(seq(A090210_AsSquareArray(n,k),k=0..6)),n=0..6);
# Peter Luschny, Mar 30 2011

t[n_, k_] := t[n, k] = Sum[(n+j)!^(k-1)/(j!^k*E), {j, 0, Infinity}]; t[_, 0] = 1;
Flatten[ Table[ t[n-k+1, k], {n, 0, 8}, {k, n, 0, -1}]][[1 ;; 43]] (* Jean-François Alcover, Jun 17 2011 *)

a(n, m) = Bell(m;n-(m-1)), n>= m-1 >=0, with Bell(m;k) := Sum_{p=m..m*k} S2(m;k, p), where S2(m;k, p) := (((-1)^p)/p!) * Sum_{r=m..p} ((-1)^r)*binomial(p, r)*fallfac(r, m)^k; with fallfac(n, m) := A008279(n, m) (falling factorials) and m<=p<=k*m, k>=1, m=1, 2, ..., else 0. From eqs.(6) with r=s->m and eq.(19) with S_{r, r}(n, k)-> S2(r;n, k) of the Blasiak et al. reference. [Corrected by Sean A. Irvine, Jun 03 2024]
a(n, m) = (Sum_{k>=m} fallfac(k, m)^(n-(m-1)))/exp(1), n>=m-1>=0, else 0. From eq.(26) with r->m of the Schork reference which is rewritten eq.(11) of the original Blasiak et al. reference.
E.g.f. m-th column (no leading zeros): (Sum_{k>=m} exp(fallfac(k, m)*x)/k!) + A000522(m)/m!)/exp(1). Rewritten from the top of p. 4656 of the Schork reference.

A091534 Generalized Stirling2 array (5,2).

Original entry on oeis.org

1, 20, 10, 1, 1120, 1040, 290, 30, 1, 123200, 161920, 71320, 14040, 1340, 60, 1, 22422400, 37452800, 22097600, 6263040, 958720, 82800, 4000, 100, 1, 6098892800, 12222918400, 8928102400, 3257116800, 675281600, 84782880, 6625920, 322000

Offset: 1

Wolfdieter Lang, Jan 23 2004

The row length sequences for this array is [1,3,5,7,9,11,...]=A005408(n-1), n>=1.

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, Phys. Lett. A 309 (2003) 198-205.
W. Lang, First 6 rows.
M. Schork, On the combinatorics of normal ordering bosonic operators and deforming it, J. Phys. A 36 (2003) 4651-4665.

Cf. A078740 (3, 2)-Stirling2, A090438 (4, 2)-Stirling2.

Cf. A072019 (row sums), A091537 (alternating row sums).

a[n_, k_] := (-1)^k/k!*Sum[(-1)^p*Binomial[k, p]*Product[FactorialPower[p + 3*(j - 1), 2], {j, 1, n}], {p, 2, k}]; Table[a[n, k], {n, 1, 8}, {k, 2, 2 n}] // Flatten (* Jean-François Alcover, Sep 01 2016 *)

a(n, k)=(((-1)^k)/k!)*sum(((-1)^p)*binomial(k, p)*product(fallfac(p+3*(j-1), 2), j=1..n), p=2..k), n>=1, 2<=k<=2*n, else 0. From eq. (12) of the Blasiak et al. reference with r=5, s=2.

Recursion: a(n, k)=sum(binomial(2, p)*fallfac(3*(n-1)+k-p, 2-p)*a(n-1, k-p), p=0..2), n>=2, 2<=k<=2*n, a(1, 2)=1, else 0. Rewritten from eq.(19) of the Schork reference with r=5, s=2. fallfac(n, m) := A008279(n, m) (falling factorials triangle).

A157391 A partition product of Stirling_1 type [parameter k = 1] with biggest-part statistic (triangle read by rows).

Original entry on oeis.org

1, 1, 1, 1, 3, 0, 1, 9, 0, 0, 1, 25, 0, 0, 0, 1, 75, 0, 0, 0, 0, 1, 231, 0, 0, 0, 0, 0, 1, 763, 0, 0, 0, 0, 0, 0, 1, 2619, 0, 0, 0, 0, 0, 0, 0, 1, 9495, 0, 0, 0, 0, 0, 0, 0, 0, 1, 35695, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 140151

Offset: 1

Peter Luschny, Mar 07 2009, Mar 14 2009

Partition product of prod_{j=0..n-2}(k-n+j+2) and n! at k = 1,
summed over parts with equal biggest part (see the Luschny link).
Underlying partition triangle is A144357.
Same partition product with length statistic is A049403.
Diagonal a(A000217(n)) = falling_factorial(1,n-1), row in A008279.
Row sum is A000085.

Peter Luschny, Counting with Partitions.
Peter Luschny, Generalized Stirling_1 Triangles.

Cf. A157386, A157385, A157384, A157383, A157400, A157391, A157392, A157393, A157394, A157395

T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = product_{j=0..n-2}(j-n+3).

A157392 A partition product of Stirling_1 type [parameter k = 2] with biggest-part statistic (triangle read by rows).

Original entry on oeis.org

1, 1, 2, 1, 6, 2, 1, 24, 8, 0, 1, 80, 60, 0, 0, 1, 330, 320, 0, 0, 0, 1, 1302, 2030, 0, 0, 0, 0, 1, 5936, 12432, 0, 0, 0, 0, 0, 1, 26784, 81368, 0, 0, 0, 0, 0, 0, 1, 133650, 545120, 0, 0, 0, 0, 0, 0, 0, 1, 669350, 3825690

Offset: 1

Peter Luschny, Mar 07 2009, Mar 14 2009

Partition product of prod_{j=0..n-2}(k-n+j+2) and n! at k = 2,
summed over parts with equal biggest part (see the Luschny link).
Underlying partition triangle is A144358.
Same partition product with length statistic is A049404.
Diagonal a(A000217(n)) = falling_factorial(2,n-1), row in A008279
Row sum is A049425.

Peter Luschny, Counting with Partitions.
Peter Luschny, Generalized Stirling_1 Triangles.

Cf. A157386, A157385, A157384, A157383, A157400, A157391, A157392, A157393, A157394, A157395

T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = = product_{j=0..n-2}(j-n+4).

A157393 A partition product of Stirling_1 type [parameter k = 3] with biggest-part statistic (triangle read by rows).

Original entry on oeis.org

1, 1, 3, 1, 9, 6, 1, 45, 24, 6, 1, 165, 240, 30, 0, 1, 855, 1560, 360, 0, 0, 1, 3843, 12180, 3360, 0, 0, 0, 1, 21819, 96096, 30660, 0, 0, 0, 0, 1, 114075, 794304, 318276, 0, 0, 0, 0, 0, 1, 703215, 6850080, 3270960, 0, 0, 0, 0, 0, 0, 1, 4125495, 62516520, 35053920, 0, 0

Offset: 1

Peter Luschny, Mar 07 2009, Mar 14 2009

Partition product prod_{j=0..n-2}(k-n+j+2) and n! at k = 3, summed over parts with equal biggest part (see the Luschny link).
Underlying partition triangle is A144877.
Same partition product with length statistic is A049410.
Diagonal a(A000217(n)) = falling_factorial(3,n-1), row in A008279.
Row sum is A049426.

Peter Luschny, Counting with Partitions.
Peter Luschny, Generalized Stirling_1 Triangles.

Cf. A157386, A157385, A157384, A157383, A157400, A157391, A157392, A157393, A157394, A157395.

T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = product_{j=0..n-2}(j-n+5).

A157395 A partition product of Stirling_1 type [parameter k = 5] with biggest-part statistic (triangle read by rows).

Original entry on oeis.org

1, 1, 5, 1, 15, 20, 1, 105, 80, 60, 1, 425, 1200, 300, 120, 1, 3075, 10400, 5400, 720, 120, 1, 15855, 102200, 75600, 15120, 840, 0, 1, 123515, 1149120, 907200, 241920, 20160, 0, 0, 1, 757755, 12783680, 13426560, 3719520, 362880

Offset: 1

Peter Luschny, Mar 07 2009, Mar 14 2009

Partition product of prod_{j=0..n-2}(k-n+j+2) and n! at k = 5,
summed over parts with equal biggest part (see the Luschny link).
Underlying partition triangle is A144879.
Same partition product with length statistic is A049411.
Diagonal a(A000217(n)) = falling_factorial(5,n-1), row in A008279
Row sum is A049428.

Peter Luschny, Counting with Partitions.
Peter Luschny, Generalized Stirling_1 Triangles.

Cf. A157386, A157385, A157384, A157383, A157400, A157391, A157392, A157393, A157394, A157395

T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = product_{j=0..n-2}(j-n+7).

A248727 A046802(x,y) --> A046802(x,y+1), transform of e.g.f. for the graded number of positroids of the totally nonnegative Grassmannians G+(k,n); enumerates faces of the stellahedra.

Original entry on oeis.org

1, 2, 1, 5, 5, 1, 16, 24, 10, 1, 65, 130, 84, 19, 1, 326, 815, 720, 265, 36, 1, 1957, 5871, 6605, 3425, 803, 69, 1, 13700, 47950, 65646, 44240, 15106, 2394, 134, 1, 109601, 438404, 707840, 589106, 267134, 63896, 7094, 263, 1

Offset: 0

Tom Copeland, Oct 12 2014

This is a transform of A046802 treating it as an array of h-vectors, so y is replaced by (y+1) in the e.g.f. for A046802.
An e.g.f. for the reversed row polynomials with signs is given by exp(a.(0;t)x) = [e^{(1+t)x} [1+t(1-e^(-x))]]^(-1) = 1 - (1+2t)x + (1+5t+5t^2)x^2/2! + ... . The reciprocal is an e.g.f. for the reversed face polynomials of the simplices A074909, i.e., exp(b.(0;t)x) = e^{(1+t)x} [1+t(1-e^(-x))] = 1 + (1+2t)x +(1+3t+3t^2) x^2/2! + ... , so the relations of A133314 apply between the two sets of polynomials. In particular, umbrally [a.(0;t)+b.(0;t)]^n vanishes except for n=0 for which it's unity, implying the two sets of Appell polynomials formed from the two bases, a_n(z;t) = (a.(0;t)+z)^n and b_n(z;t) = (b.(0;t) + z)^n, are an umbral compositional inverse pair, i.e., b_n(a.(x;t);t)= x^n = a_n(b.(x;t);t). Raising operators for these Appell polynomials are related to the polynomials of A028246, whose reverse polynomials are given by A123125 * A007318. Compare: A248727 = A007318 * A123125 * A007318 and A046802 = A007318 * A123125. See A074909 for definitions and related links. - Tom Copeland, Jan 21 2015
The o.g.f. for the umbral inverses is Og(x) = x / (1 - x b.(0;t)) = x / [(1-tx)(1-(1+t)x)] = x + (1+2t) x^2 + (1+3t+3t^2) x^3 + ... . Its compositional inverse is an o.g.f for signed A033282, the reverse f-polynomials for the simplicial duals of the Stasheff polytopes, or associahedra of type A, Oginv(x) =[1+(1+2t)x-sqrt[1+2(1+2t)x+x^2]] / (2t(1+t)x) = x - (1+2t) x^2 + (1+5t+5t^2) x^3 + ... . Contrast this with the o.g.f.s related to the corresponding h-polynomials in A046802. - Tom Copeland, Jan 24 2015
Face vectors, or coefficients of the face polynomials, of the stellahedra, or stellohedra. See p. 59 of Buchstaber and Panov. - Tom Copeland, Nov 08 2016
See A008279 for a relation between the e.g.f.s enumerating the faces of permutahedra and stellahedra. - Tom Copeland, Nov 14 2016

			The triangle T(n, k) starts:
n\k    0     1     2     3     4    5   6  7 ...
1:     1
2:     2     1
3:     5     5     1
4:    16    24    10     1
5:    65   130    84    19     1
6:   326   815   720   265    36    1
7:  1957  5871  6605  3425   803   69   1
8: 13700 47950 65646 44240 15106 2394 134  1
... reformatted, _Wolfdieter Lang_, Mar 27 2015

P. Barry, Three Études on a sequence transformation pipeline, arXiv:1803.06408 [math.CO], 2018.
L. Berry, S. Forcey, M. Ronco, and P. Showers, Polytopes and Hopf algebras of painted trees: Fan graphs and Stellohedra, arXiv:1608.08546 [math.CO], 2018.
L. Berry, S. Forcey, M. Ronco, and P. Showers, Species substitution, graph suspension, and graded Hopf algebras of painted tree polytopes, arXiv:1608.08546 [math.CO], 2019.
V. Buchstaber and T. Panov, Toric Topology, arXiv:1210.2368v3 [math.AT], 2014.
R. Da Rosa, D. Jensen, and D. Ranganathan, Toric graph associahedra and compactifications of M_(0,n), arXiv:1411.0537 [math.AG], 2015.
S. Forcey, M. Ronco, and P. Showers, Polytopes and algebras of grafted trees: Stellohedra, arXiv:1608.08546v2 [math.CO], 2016.
Stefan Forcey, The Hedra Zoo
I. Limonchenko, Moment-angle manifolds, 2-truncated cubes and Massey operations, arXiv:1510.07778 [math.AT], 2017.
M. Lin, Graph Cohomology, 2016, (Fig. 2.5 is a stellahedron).
T. Manneville and V. Pilaud, Compatibility fans for graphical nested complexes, arXiv:1501.07152v3 [math.CO], 2015-2016.
MathOverflow, Analogue of conic sections for the permutohedra, associahedra, and noncrossing partitions, an MO question posed by T. Copeland, 2017. (See Buchstaber references therein.)
V. Pilaud, The Associahedron and its Friends, presentation for Séminaire Lotharingien de Combinatoire, April 4-6, 2016. [From _Tom Copeland_, Jun 26 2018]

Cf. A046802, A007047, A122045, A000522, A036918, A001339, A052944.
Cf. A074909, A028246, A133314, A007318, A123125, A033282.
Cf. A008279, A008292, A090582, A097808, A130850.
Cf. A019538, A119879.

(* t = A046802 *) t[, 1] = 1; t[n, n_] = 1; t[n_, 2] = 2^(n - 1) - 1; t[n_, k_] = Sum[((i - k + 1)^i*(k - i)^(n - i - 1) - (i - k + 2)^i*(k - i - 1)^(n - i - 1))*Binomial[n - 1, i], {i, 0, k - 1}]; T[n_, j_] := Sum[Binomial[k, j]*t[n + 1, k + 1], {k, j, n}]; Table[T[n, k], {n, 0, 10}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jan 23 2015, after Tom Copeland *)

Let M(n,k)= sum{i=0,..,k-1, C(n,i)[(i-k)^i*(k-i+1)^(n-i)- (i-k+1)^i*(k-i)^(n-i)]} with M(n,0)=1. Then M(n,k)= A046802(n,k), and T(n,j)= sum(k=j,..,n, C(k,j)*M(n,k)) for j>0 with T(n,0)= 1 + sum(k=1,..,n, M(n,k)) for n>0 and T(0,0)=1.
E.g.f: y * exp[x*(y+1)]/[y+1-exp(x*y)].
Row sums are A007047. Row polynomials evaluated at -1 are unity. Row polynomials evaluated at -2 are A122045.
First column is A000522. Second column appears to be A036918/2 = (A001339-1)/2 = n*A000522(n)/2.
Second diagonal is A052944. (Changed from conjecture to fact on Nov 08 2016.)
The raising operator for the reverse row polynomials with row signs is R = x - (1+t) - t e^(-D) / [1 + t(1-e^(-D))] evaluated at x = 0, with D = d/dx. Also R = x - d/dD log[exp(a.(0;t)D], or R = - d/dz log[e^(-xz) exp(a.(0;t)z)] = - d/dz log[exp(a.(-x;t)z)] with the e.g.f. defined in the comments and z replaced by D. Note that t e ^(-D) / [1+t(1-e^(-D))] = t - (t+t^2) D + (t+3t^2+2t^3) D^2/2! - ... is an e.g.f. for the signed reverse row polynomials of A028246. - Tom Copeland, Jan 23 2015
Equals A007318*(padded A090582)*A007318*A097808 = A007318*(padded (A008292*A007318))*A007318*A097808 = A007318*A130850 = A007318*(mirror of A028246). Padded means in the same way that A097805 is padded A007318. - Tom Copeland, Nov 14 2016
Umbrally, the row polynomials are p_n(x) = (1 + q.(x))^n, where (q.(x))^k = q_k(x) are the row polynomials of A130850. - Tom Copeland, Nov 16 2016
From the previous umbral statement, OP(x,d/dy) y^n =  (y + q.(x))^n, where OP(x,y) = exp[y * q.(x)] = x/((1+x)*exp(-x*y) - 1), the e.g.f. of A130850, so OP(x,d/dy) y^n evaluated at y = 1 is  p_n(x), the n-th row polynomial of this entry, with offset 0. - Tom Copeland, Jun 25 2018
Consolidating some formulas in this entry and A046082, in umbral notation for concision, with all offsets 0: Let A_n(x;y) = (y + E.(x))^n, an Appell sequence in y where E.(x)^k = E_k(x) are the Eulerian polynomials of A123125. Then the row polynomials of A046802 (the h-polynomials of the stellahedra) are given by h_n(x) = A_n(x;1); the row polynomials of this entry (A248727, the face polynomials of the stellahedra), by f_n(x) = A_n(1 + x;1); the Swiss-knife polynomials of A119879, by Sw_n(x) = A_n(-1;1 + x); and the row polynomials of the Worpitsky triangle (A130850), by w_n(x) = A(1 + x;0). Other specializations of A_n(x;y) give A090582 (the f-polynomials of the permutohedra, cf. also A019538) and A028246 (another version of the Worpitsky triangle). - Tom Copeland, Jan 24 2020

Title expanded by Tom Copeland, Nov 08 2016

cp's OEIS Frontend

A090657 Triangle read by rows: T(n,k) = number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly k elements (0<=k<=n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A157394 A partition product of Stirling_1 type [parameter k = 4] with biggest-part statistic (triangle read by rows).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A049403 A triangle of numbers related to triangle A030528; array a(n,m), read by rows (1 <= m <= n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A090210 Triangle of certain generalized Bell numbers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A091534 Generalized Stirling2 array (5,2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A157391 A partition product of Stirling_1 type [parameter k = 1] with biggest-part statistic (triangle read by rows).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A157392 A partition product of Stirling_1 type [parameter k = 2] with biggest-part statistic (triangle read by rows).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A157393 A partition product of Stirling_1 type [parameter k = 3] with biggest-part statistic (triangle read by rows).

Views

Author

Keywords

Comments

Links