A003128 -id:A003128 - cp's OEIS frontend

A005493 2-Bell numbers: a(n) = number of partitions of [n+1] with a distinguished block.

1, 3, 10, 37, 151, 674, 3263, 17007, 94828, 562595, 3535027, 23430840, 163254885, 1192059223, 9097183602, 72384727657, 599211936355, 5150665398898, 45891416030315, 423145657921379, 4031845922290572, 39645290116637023, 401806863439720943, 4192631462935194064

Offset: 0

N. J. A. Sloane, Simon Plouffe

Number of Boolean sublattices of the Boolean lattice of subsets of {1..n}.
a(n) = p(n+1) where p(x) is the unique degree n polynomial such that p(k) = A000110(k+1) for k = 0, 1, ..., n. - Michael Somos, Oct 07 2003
With offset 1, number of permutations beginning with 12 and avoiding 21-3.
Rows sums of Bell's triangle (A011971). - Jorge Coveiro, Dec 26 2004
Number of blocks in all set partitions of an (n+1)-set. Example: a(2)=10 because the set partitions of {1,2,3} are 1|2|3, 1|23, 12|3, 13|2 and 123, with a total of 10 blocks. - Emeric Deutsch, Nov 13 2006
Number of partitions of n+3 with at least one singleton and with the smallest element in a singleton equal to 2. - Olivier Gérard, Oct 29 2007
See page 29, Theorem 5.6 of my paper on the arXiv: These numbers are the dimensions of the homogeneous components of the operad called ComTrip associated with commutative triplicial algebras. (Triplicial algebras are related to even trees and also to L-algebras, see A006013.) - Philippe Leroux, Nov 17 2007
Number of set partitions of (n+2) elements where two specific elements are clustered separately. Example: a(1)=3 because 1/2/3, 1/23, 13/2 are the 3 set partitions with 1, 2 clustered separately. - Andrey Goder (andy.goder(AT)gmail.com), Dec 17 2007
Equals A008277 * [1,2,3,...], i.e., the product of the Stirling number of the second kind triangle and the natural number vector. a(n+1) = row sums of triangle A137650. - Gary W. Adamson, Jan 31 2008
Prefaced with a "1" = row sums of triangle A152433. - Gary W. Adamson, Dec 04 2008
Equals row sums of triangle A159573. - Gary W. Adamson, Apr 16 2009
Number of embedded coalitions in an (n+1)-person game. - David Yeung (wkyeung(AT)hkbu.edu.hk), May 08 2008
If prefixed with 0, gives first differences of Bell numbers A000110 (cf. A106436). - N. J. A. Sloane, Aug 29 2013
Sum_{n>=0} a(n)/n! = e^(e+1) = 41.19355567... (see A235214). Contrast with e^(e-1) = Sum_{n>=0} A000110(n)/n!. - Richard R. Forberg, Jan 05 2014

			For example, a(1) counts (12), (1)-2, 1-(2) where dashes separate blocks and the distinguished block is parenthesized.

Olivier Gérard and Karol A. Penson, A budget of set partition statistics, in preparation. Unpublished as of 2017.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Chai Wah Wu, Table of n, a(n) for n = 0..574 (first 101 terms from T. D. Noe)
V. E. Adler, Set partitions and integrable hierarchies, arXiv:1510.02900 [nlin.SI], 2015.
M. Brookes, J. East, C. Miller, J.D. Mitchell, and N. Ruskuc, Heights of one- and two-sided congruence lattices of semigroups, arXiv:2310.08229 [math.GR], 2023.
Giulio Cerbai, Modified ascent sequences and Bell numbers, arXiv:2305.10820 [math.CO], 2023. See p. 11.
Martin Cohn, Shimon Even, Karl Menger, Jr., and Philip K. Hooper, On the Number of Partitionings of a Set of n Distinct Objects, Amer. Math. Monthly 69 (1962), no. 8, 782--785. MR1531841.
Martin Cohn, Shimon Even, Karl Menger, Jr., and Philip K. Hooper, On the Number of Partitionings of a Set of n Distinct Objects, Amer. Math. Monthly 69 (1962), no. 8, 782--785. MR1531841. [Annotated scanned copy]
R. B. Corcino and C. B. Corcino, On generalized Bell polynomials, Discrete Dyn. Nat. Soc. Article ID: 623456 (2011).
C. B. Corcino and R. B. Corcino, An asymptotic formula for r-Bell numbers with real arguments, ISRN Discrete Math, 2013 (2013), Article ID 274697.
Gábor Czédli, Lattices with lots of congruence energy, arXiv:2205.02294 [math.RA], 2022.
A. Dil and V. Kurt, Polynomials related to harmonic numbers and evaluation of harmonic number series II, Appl. Anal. Discrete Math. 5 (2011), 212-229.
Eldar Fischer, Johann A. Makowsky, and Vsevolod Rakita, MC-finiteness of restricted set partition functions, arXiv:2302.08265 [math.CO], 2023.
A. L. L. Gao, S. Kitaev, and P. B. Zhang, On pattern avoiding indecomposable permutations, arXiv:1605.05490 [math.CO], 2016.
S. Getu et al., How to guess a generating function, SIAM J. Discrete Math., 5 (1992), 497-499.
S. K. Ghosal and J. K. Mandal, Stirling Transform Based Color Image Authentication, Procedia Technology, 2013 Volume 10, 2013, Pages 95-104.
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, and Pierre Hauweele, Upper bounds on the average number of colors in the non-equivalent colorings of a graph, arXiv:2105.01120 [math.CO], 2021.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 152
R. Jakimczuk, Successive Derivatives and Integer Sequences, J. Int. Seq. 14 (2011) # 11.7.3.
S. Kitaev, Generalized pattern avoidance with additional restrictions, Sem. Lothar. Combinat. B48e (2003).
S. Kitaev and T. Mansour, Simultaneous avoidance of generalized patterns, arXiv:math/0205182 [math.CO], 2002.
J. W. Layman, The Hankel Transform and Some of its Properties, J. Integer Sequences, 4 (2001), #01.1.5.
Philippe Leroux, L-algebras, triplicial-algebras, within an equivalence of categories motivated by graphs (formerly "An equivalence of categories motivated by weighted directed graphs"), arXiv:0709.3453 [math-ph], 2007-2008.
Toufik Mansour and Mark Shattuck, A recurrence related to the Bell numbers, INTEGERS 11 (2011), #A67.
I. Mezo, The r-Bell numbers, J. Integer Seq. 14(1) (2011), Article 11.1.1.
I. Mezo, Periodicity of the last digits of some combinatorial sequences, arXiv preprint arXiv:1308.1637 [math.CO], 2013.
A. M. Odlyzko, Asymptotic enumeration methods, pp. 1063-1229 of R. L. Graham et al., eds., Handbook of Combinatorics, 1995; see Example 12.16 (pdf, ps)
Jocelyn Quaintance and Harris Kwong, A combinatorial interpretation of the Catalan and Bell number difference tables, Integers, 13 (2013), #A29.
J. Riordan, Letter, Oct 31 1977
Eric Weisstein's World of Mathematics, Stirling Transform.
Eric Weisstein's World of Mathematics, Bell Triangle
E. G. Whitehead, Jr., Stirling number identities from chromatic polynomials, J. Combin. Theory, A 24 (1978), 314-317.
David W. K. Yeung, Recursive sequence identifying the number of embedded coalitions, International Game Theory Review 10 (1) (2008), 129-136.

Cf. A000110, A005494, A008277, A011971, A011968, A049020, A106436, A124323, A137650, A152433, A159573.
A row or column of the array A108087.
Row sums of triangle A143494. - Wolfdieter Lang, Sep 29 2011. And also of triangle A362924. - N. J. A. Sloane, Aug 10 2023

with(combinat): seq(bell(n+2)-bell(n+1),n=0..22); # Emeric Deutsch, Nov 13 2006
seq(add(binomial(n, k)*(bell(n-k)), k=1..n), n=1..23); # Zerinvary Lajos, Dec 01 2006
A005493  := proc(n) local a,b,i;
a := [seq(3,i=1..n)]; b := [seq(2,i=1..n)];
2^n*exp(-x)*hypergeom(a,b,x); round(evalf(subs(x=1,%),66)) end:
seq(A005493(n),n=0..22); # Peter Luschny, Mar 30 2011
BT := proc(n,k) option remember; if n = 0 and k = 0 then 1
elif k = n then BT(n-1,0) else BT(n,k+1)+BT(n-1,k) fi end:
A005493 := n -> add(BT(n,k),k=0..n):
seq(A005493(i),i=0..22); # Peter Luschny, Aug 04 2011
# For Maple code for r-Bell numbers, etc., see A232472. - N. J. A. Sloane, Nov 27 2013

a=Exp[x]-1; Rest[CoefficientList[Series[a Exp[a],{x,0,20}],x] * Table[n!,{n,0,20}]]
a[ n_] := If[ n<0, 0, With[ {m = n+1}, m! SeriesCoefficient[ # Exp@# &[ Exp@x - 1], {x, 0, m}]]]; (* Michael Somos, Nov 16 2011 *)
Differences[BellB[Range[30]]] (* Harvey P. Dale, Oct 16 2014 *)

{a(n) = if( n<0, 0, n! * polcoeff( exp( exp( x + x * O(x^n)) + 2*x - 1), n))}; /* Michael Somos, Oct 09 2002 */

{a(n) = if( n<0, 0, n+=2; subst( polinterpolate( Vec( serlaplace( exp( exp( x + O(x^n)) - 1) - 1))), x, n))}; /* Michael Somos, Oct 07 2003 */

# requires python 3.2 or higher. Otherwise use def'n of accumulate in python docs.
from itertools import accumulate
A005493_list, blist, b = [], [1], 1
for _ in range(1001):
    blist = list(accumulate([b]+blist))
    b = blist[-1]
    A005493_list.append(blist[-2])
# Chai Wah Wu, Sep 02 2014, updated Chai Wah Wu, Sep 20 2014

a(n-1) = Sum_{k=1..n} k*Stirling2(n, k) for n>=1.
E.g.f.: exp(exp(x) + 2*x - 1). First differences of Bell numbers (if offset 1). - Michael Somos, Oct 09 2002
G.f.: Sum_{k>=0} (x^k/Product_{l=1..k} (1-(l+1)x)). - Ralf Stephan, Apr 18 2004
a(n) = Sum_{i=0..n} 2^(n-i)*B(i)*binomial(n,i) where B(n) = Bell numbers A000110(n). - Fred Lunnon, Aug 04 2007 [Written umbrally, a(n) = (B+2)^n. - N. J. A. Sloane, Feb 07 2009]
Representation as an infinite series: a(n-1) = Sum_{k>=2} (k^n*(k-1)/k!)/exp(1), n=1, 2, ... This is a Dobinski-type summation formula. - Karol A. Penson, Mar 14 2002
Row sums of A011971 (Aitken's array, also called Bell triangle). - Philippe Deléham, Nov 15 2003
a(n) = exp(-1)*Sum_{k>=0} ((k+2)^n)/k!. - Gerald McGarvey, Jun 03 2004
Recurrence: a(n+1) = 1 + Sum_{j=1..n} (1+binomial(n, j))*a(j). - Jon Perry, Apr 25 2005
a(n) = A000296(n+3) - A000296(n+1). - Philippe Deléham, Jul 31 2005
a(n) = B(n+2) - B(n+1), where B(n) are Bell numbers (A000110). - Franklin T. Adams-Watters, Jul 13 2006
a(n) = A123158(n,2). - Philippe Deléham, Oct 06 2006
Binomial transform of Bell numbers 1, 2, 5, 15, 52, 203, 877, 4140, ... (see A000110).
Define f_1(x), f_2(x), ... such that f_1(x)=x*e^x, f_{n+1}(x) = (d/dx)(x*f_n(x)), for n=2,3,.... Then a(n-1) = e^(-1)*f_n(1). - Milan Janjic, May 30 2008
Representation of numbers a(n), n=0,1..., as special values of hypergeometric function of type (n)F(n), in Maple notation: a(n)=exp(-1)*2^n*hypergeom([3,3...3],[2.2...2],1), n=0,1..., i.e., having n parameters all equal to 3 in the numerator, having n parameters all equal to 2 in the denominator and the value of the argument equal to 1. Examples: a(0)= 2^0*evalf(hypergeom([],[],1)/exp(1))=1 a(1)= 2^1*evalf(hypergeom([3],[2],1)/exp(1))=3 a(2)= 2^2*evalf(hypergeom([3,3],[2,2],1)/exp(1))=10 a(3)= 2^3*evalf(hypergeom([3,3,3],[2,2,2],1)/exp(1))=37 a(4)= 2^4*evalf(hypergeom([3,3,3,3],[2,2,2,2],1)/exp(1))=151 a(5)= 2^5*evalf(hypergeom([3,3,3,3,3],[2,2,2,2,2],1)/exp(1)) = 674. - Karol A. Penson, Sep 28 2007
Let A be the upper Hessenberg matrix of order n defined by: A[i,i-1]=-1, A[i,j]=binomial(j-1,i-1), (i <= j), and A[i,j]=0 otherwise. Then, for n >= 1, a(n) = (-1)^(n)charpoly(A,-2). - Milan Janjic, Jul 08 2010
a(n) = D^(n+1)(x*exp(x)) evaluated at x = 0, where D is the operator (1+x)*d/dx. Cf. A003128, A052852 and A009737. - Peter Bala, Nov 25 2011
From Sergei N. Gladkovskii, Oct 11 2012 to Jan 26 2014: (Start)
Continued fractions:
G.f.: 1/U(0) where U(k) = 1 - x*(k+3) - x^2*(k+1)/U(k+1).
G.f.: 1/(U(0)-x) where U(k) = 1 - x - x*(k+1)/(1 - x/U(k+1)).
G.f.: G(0)/(1-x) where G(k) = 1 - 2*x*(k+1)/((2*k+1)*(2*x*k+2*x-1) - x*(2*k+1)*(2*k+3)*(2*x*k+2*x-1)/(x*(2*k+3) - 2*(k+1)*(2*x*k+3*x-1)/G(k+1) )).
G.f.: (G(0) - 1)/(x-1) where G(k) = 1 - 1/(1-2*x-k*x)/(1-x/(x-1/G(k+1) )).
G.f.: -G(0)/x where G(k) = 1 - 1/(1-k*x-x)/(1-x/(x-1/G(k+1) )).
G.f.: 1 - 2/x + (1/x-1)*S where S = sum(k>=0, ( 1 + (1-x)/(1-x-x*k) )*(x/(1-x))^k / prod(i=0..k-1, (1-x-x*i)/(1-x) ) ).
G.f.: (1-x)/x/(G(0)-x) - 1/x where G(k) = 1 - x*(k+1)/(1 - x/G(k+1) ).
G.f.: (1/G(0) - 1)/x^3 where G(k) = 1 - x/(x - 1/(1 + 1/(x*k-1)/G(k+1) )).
G.f.: 1/Q(0), where Q(k)= 1 - 2*x - x/(1 - x*(k+1)/Q(k+1)).
G.f.: G(0)/(1-3*x), where G(k) = 1 - x^2*(k+1)/( x^2*(k+1) - (1 - x*(k+3))*(1 - x*(k+4))/G(k+1) ). (End)
a(n) ~ exp(n/LambertW(n) + 3*LambertW(n)/2 - n - 1) * n^(n + 1/2) / LambertW(n)^(n+1). - Vaclav Kotesovec, Jun 09 2020
a(0) = 1; a(n) = 2 * a(n-1) + Sum_{k=0..n-1} binomial(n-1,k) * a(k). - Ilya Gutkovskiy, Jul 02 2020
a(n) ~ n^2 * Bell(n) / LambertW(n)^2 * (1 - LambertW(n)/n). - Vaclav Kotesovec, Jul 28 2021
a(n) = Sum_{k=0..n} 3^k*A124323(n, k). - Mélika Tebni, Jun 02 2022

Definition revised by David Callan, Oct 11 2005

A049020 Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 5, 10, 6, 1, 15, 37, 31, 10, 1, 52, 151, 160, 75, 15, 1, 203, 674, 856, 520, 155, 21, 1, 877, 3263, 4802, 3556, 1400, 287, 28, 1, 4140, 17007, 28337, 24626, 11991, 3290, 490, 36, 1, 21147, 94828, 175896, 174805, 101031, 34671, 6972, 786, 45, 1

Offset: 0

N. J. A. Sloane

Triangle a(n,k) read by rows; given by [1, 1, 1, 2, 1, 3, 1, 4, 1, 5, 1, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...] where DELTA is Deléham's operator defined in A084938.
Exponential Riordan array [exp(exp(x)-1), exp(x)-1]. - Paul Barry, Jan 12 2009
Equal to A048993*A007318. - Philippe Deléham, Oct 31 2011
This lower unitriangular array is the L factor in the LU decomposition of the Hankel matrix (Bell(i+j-2))A000110(n).%20The%20U%20factor%20is%20A059098%20(see%20Chamberland,%20p.%201672).%20-%20_Peter%20Bala">i,j >= 1, where Bell(n) = A000110(n). The U factor is A059098 (see Chamberland, p. 1672). - _Peter Bala, Oct 15 2023

			Triangle begins:
   1;
   1,  1;
   2,  3,  1;
   5, 10,  6,  1;
  15, 37, 31, 10,  1;
  ...
From _Paul Barry_, Jan 12 2009: (Start)
Production array begins
  1, 1;
  1, 2, 1;
  0, 2, 3, 1;
  0, 0, 3, 4, 1;
  0, 0, 0, 4, 5, 1;
  ... (End)

Alois P. Heinz, Rows n = 0..140, flattened
M. Aigner, A characterization of the Bell numbers, Discr. Math., 205 (1999), 207-210.
Paul Barry, Constructing Exponential Riordan Arrays from Their A and Z Sequences, Journal of Integer Sequences, 17 (2014), #14.2.6.
Zhanar Berikkyzy, Pamela E. Harris, Anna Pun, Catherine Yan, and Chenchen Zhao, Combinatorial Identities for Vacillating Tableaux, arXiv:2308.14183 [math.CO], 2023. See p. 11.
Marc Chamberland, Factored matrices can generate combinatorial identities, Linear Algebra and its Applications, Volume 438, Issue 4, 15 Feb. 2013, pp. 1667-1677.
J. East and R. D. Gray, Idempotent generators in finite partition monoids and related semigroups, arXiv preprint arXiv:1404.2359 [math.GR], 2014.
Tom Halverson and Theodore N. Jacobson, Set-partition tableaux and representations of diagram algebras, arXiv:1808.08118 [math.RT], 2018.
Aoife Hennessy and Paul Barry, Generalized Stirling Numbers, Exponential Riordan Arrays, and Orthogonal Polynomials, J. Int. Seq. 14 (2011) # 11.8.2.
Marin Knežević, Vedran Krčadinac, and Lucija Relić, Matrix products of binomial coefficients and unsigned Stirling numbers, arXiv:2012.15307 [math.CO], 2020.
W. F. Lunnon et al., Arithmetic properties of Bell numbers to a composite modulus I, Acta Arith., 35 (1979), 1-16.
J. Riordan, Letter, Oct 31 1977. The array is on the second page.

First column gives A000110, second column = A005493.
Third column = A003128, row sums = A001861, A059340.
See A244489 for another version of this triangle.
Cf. A059098, A245109, A046716.

a:= proc(n, k) option remember; `if`(k<0 or k>n, 0,
      `if`(n=0, 1, a(n-1, k-1) +(k+1)*(a(n-1, k) +a(n-1, k+1))))
    end:
seq(seq(a(n, k), k=0..n), n=0..15);  # Alois P. Heinz, Nov 30 2012

a[n_, k_] = Sum[StirlingS2[n, i]*Binomial[i, k], {i, 0, n}]; Flatten[Table[a[n, k], {n, 0, 9}, {k, 0, n}]]
(* Jean-François Alcover, Aug 29 2011, after Vladeta Jovovic *)

T(n,k)=if(k<0 || k>n,0,n!*polcoeff(polcoeff(exp((1+y)*(exp(x+x*O(x^n))-1)),n),k))

def A049020_triangle(dim):
    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+1)*M[n-1, k]+(k+1)*M[n-1, k+1]
    return M
A049020_triangle(9) # Peter Luschny, Sep 19 2012

a(n,k) = a(n-1, k-1) + (k+1)*a(n-1, k) + (k+1)*a(n-1, k+1), n >= 1.
a(n,k) = Sum_{i=0..n} Stirling2(n,i)*binomial(i,k). - Vladeta Jovovic, Jan 27 2001
E.g.f. for the k-th column is (1/k!)*(exp(x)-1)^k*exp(exp(x)-1). - Vladeta Jovovic, Jan 27 2001
G.f.: 1/(1-x-xy-x^2(1+y)/(1-2x-xy-2x^2(1+y)/(1-3x-xy-3x^2(1+y)/(1-4x-xy-4x^2(1+y)/(1-... (continued fraction). - Paul Barry, Apr 29 2009
E.g.f.: exp((y+1)*(exp(x)-1)). - Geoffrey Critzer, Nov 30 2012
Note that A244489 (which is essentially the same triangle) has the formula T(n,k) = Sum_{j=k..n} binomial(n,j)*Stirling_2(j,k)*Bell(n-j), where Bell(n) = A000110(n), for n >= 1, 0 <= k <= n-1. - N. J. A. Sloane, May 17 2016
a(2n,n) = A245109(n). - Alois P. Heinz, Aug 23 2017
Empirical: a(n,k) = p(1^n)[st(1^k)] (see A002872 for notation). - Andrey Zabolotskiy, Oct 17 2017
a(n,k) = Sum_{j=0..k} (-1)^(k-j)*A046716(k, k-j)*Bell(n + j)/k!. - Peter Luschny, Dec 06 2023

More terms from James Sellers.

Better definition from Geoffrey Critzer, Nov 30 2012.

A123158 Square array related to Bell numbers read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 5, 5, 3, 1, 15, 15, 10, 5, 1, 52, 52, 37, 22, 6, 1, 203, 203, 151, 99, 31, 9, 1, 877, 877, 674, 471, 160, 61, 10, 1, 4140, 4140, 3263, 2386, 856, 385, 75, 14, 1, 21147, 21147, 17007, 12867, 4802, 2416, 520, 135, 15, 1

Offset: 0

Philippe Deléham, Oct 01 2006

			Square array, A(n, k), begins:
   1,   1,   1,    1,    1, ... (Row n=0: A000012);
   1,   2,   3,    5,    6, ... (Row n=1: A117142);
   2,   5,  10,   22,   31, ...;
   5,  15,  37,   99,  160, ...;
  15,  52, 151,  471,  856, ...;
  52, 203, 674, 2386, 4802, ...;
Antidiagonals, T(n, k), begin as:
    1;
    1,   1;
    2,   2,   1;
    5,   5,   3,   1;
   15,  15,  10,   5,   1;
   52,  52,  37,  22,   6,  1;
  203, 203, 151,  99,  31,  9,   1;
  877, 877, 674, 471, 160, 61,  10,  1;

G. C. Greubel, Antidiagonals n = 0..50, flattened

Columns include: A000110 (Bell numbers), A003128, A005493, A033452.

Rows include: A000012, A117142.

function A(n,k)
  if k lt 0 or n lt 0 then return 0;
  elif n eq 0 then return 1;
  elif (k mod 2) eq 1 then return A(n,k-1) + (1/2)*(k+1)*A(n-1,k+1);
  else return A(n,k-1) + A(n-1,k+1);
  end if;
end function;
T:= func< n,k | A(n-k,k) >;
[T(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Jul 18 2023

A[0, _?NonNegative] = 1;
A[n_, k_]:= A[n, k]= If[n<0 || k<0, 0, If[OddQ[k], A[n, k-1] + (1/2)(k+1) A[n-1, k+1], A[n, k-1] + A[n-1, k+1]]];
Table[A[n-k, k], {n,0,10}, {k,0,n}]//Flatten (* Jean-François Alcover, Feb 21 2020 *)

@CachedFunction
def A(n,k):
    if (k<0 or n<0): return 0
    elif (n==0): return 1
    elif (k%2==1): return A(n,k-1) +(1/2)*(k+1)*A(n-1,k+1)
    else: return A(n,k-1) +A(n-1,k+1)
def T(n,k): return A(n-k,k)
flatten([[T(n,k) for k in range(n+1)] for n in range(12)]) # G. C. Greubel, Jul 18 2023

A(n, k) = 0 if n < 0, A(0, k) = 1 for k >= 0, A(n, k) = A(n, k-1) + (1/2)*(k+1)*A(n-1, k+1) if k is an odd number, A(n, k) = A(n, k-1) + A(n-1, k+1) if k is an even number (array).
A(n, 0) = A000110(n).
A(n, 1) = A000110(n+1).
A(n, 2) = A005493(n).
A(n, 3) = A033452(n).
A(n, 4) = A003128(n+2).
T(n, k) = A(n-k, k) (antidiagonals).

A003129 Number of transfer impedances of an n-terminal network.

Original entry on oeis.org

0, 3, 33, 270, 2025, 14868, 109851, 827508, 6397665, 50932233, 418175274, 3542883864, 30972408558, 279287247333, 2596195945977, 24862074701208, 245091667488207, 2485294443056496, 25903024863885465, 277278282774462210

Offset: 2

N. J. A. Sloane

nonn

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

G. C. Greubel, Table of n, a(n) for n = 2..570
J. Riordan, The number of impedances of an n-terminal network, Bell Syst. Tech. J., 18 (1939), 300-314.

Cf. A003128, A003130.

[(&+[Binomial(Binomial(k,2),2)*StirlingSecond(n,k): k in [0..n]]): n in [2..40]]; // G. C. Greubel, Nov 04 2022

A003129[n_]:= A003129[n]= Sum[StirlingS2[n,k]*Binomial[Binomial[k,2],2], {k,0,n}];
Table[A003129[n], {n, 0, 40}] (* G. C. Greubel, Nov 04 2022 *)

def A003129(n): return sum(binomial(binomial(k,2), 2)*stirling_number2(n,k) for k in range(n+1))
[A003129(n) for n in range(2,40)] # G. C. Greubel, Nov 04 2022

E.g.f.: (exp(x) + 3)*(exp(x) - 1)^3*exp(exp(x) - 1)/8.

a(n) = Sum_{k=0..n} Stirling2(n,k)*binomial(binomial(k,2),2).

A003130 Impedances of an n-terminal network.

Original entry on oeis.org

1, 12, 157, 1750, 17446, 164108, 1505099, 13720902, 125782441, 1167813944, 11029947952, 106273227216, 1046320856673, 10537366304920, 108606982421301, 1145873284492738, 12375688888657414, 136802023177966948, 1547385154016264531

Offset: 2

N. J. A. Sloane

nonn

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

G. C. Greubel, Table of n, a(n) for n = 2..565
J. Riordan, The number of impedances of an n-terminal network, Bell Syst. Tech. J., 18 (1939), 300-314.

Cf. A003128, A003129.

A003128:= func< n | (&+[Binomial(k,2)*StirlingSecond(n,k): k in [0..n]]) >;
A003129:= func< n | (&+[Binomial(Binomial(k,2),2)*StirlingSecond(n,k): k in [0..n]]) >;
U:= func< n | 15*(&+[k*Binomial(k+1,5)*StirlingSecond(n,k): k in [0..n]]) >;
A003130:= func< n | A003128(n)+ 2*A003129(n) +U(n) >;
[A003130(n): n in [2..40]]; // G. C. Greubel, Nov 04 2022

A003128[n_]:= A003128[n]= Sum[StirlingS2[n, k]*Binomial[k, 2], {k,0,n}];
A003129[n_]:= A003129[n]= Sum[StirlingS2[n,k]*Binomial[Binomial[k,2],2], {k,0,n}];
U[n_]:= Sum[15*k*Binomial[k+1,5]*StirlingS2[n,k], {k,0,n}];
A003130[n_]:= A003128[n] +2*A003129[n] +U[n];
Table[A003130[n], {n,0,40}] (* G. C. Greubel, Nov 04 2022 *)

def A003128(n): return sum(binomial(k,2)*stirling_number2(n,k) for k in range(n+1))
def A003129(n): return sum(binomial(binomial(k,2), 2)*stirling_number2(n,k) for k in range(n+1))
def U(n): return 15*sum(k*binomial(k+1,5)*stirling_number2(n,k) for k in range(n+1))
def A003130(n): return A003128(n) +2*A003129(n) +U(n)
[A003130(n) for n in range(2,40)] # G. C. Greubel, Nov 04 2022

a(n) = A003128(n) + 2 * A003129(n) + U(n) where U(n) = Sum_{k=2..n} u(n) * Stirling2(n, k), and u(n) = (20(n)4 + 10(n)_5 + (n)_6) / 8 where (n)_k = n * (n - 1) * ... * (n - k + 1) denotes the falling factorial. - _Sean A. Irvine, Feb 03 2015

More terms from Sean A. Irvine, Feb 03 2015

A039759 Number of edges in the Hasse diagrams for the B-analogs of the partition lattices.

Original entry on oeis.org

0, 1, 8, 58, 432, 3396, 28384, 252456, 2385280, 23874448, 252380800, 2809461920, 32841595136, 402105388608, 5144478074368, 68625615724160, 952603633463296, 13735016459768064, 205358227932235776, 3179027634604907008, 50881656554805620736, 840901491722391454720, 14332437167995507302400

Offset: 0

Ruedi Suter (suter(AT)math.ethz.ch)

nonn

R. Suter, Two analogues of a classical sequence, J. Integer Sequences, Vol. 3 (2000), #P00.1.8.

Edges in the Hasse diagrams for partition lattices: A003128, D-analogs = A039765.

max = 18; CoefficientList[ Series[1/4*E^x*(E^(4*x) - 1)*E^((1/2)*(E^(2*x) - 1)), {x, 0, max}], x]*Range[0, max]! (* Jean-François Alcover, Oct 04 2013, after e.g.f. *)

x='x+O('x^66); concat([0], Vec( serlaplace( 1/4*(exp(4*x)-1)*exp(1/2*exp(2*x)+x-1/2) ) ) ) \\ Joerg Arndt, Oct 04 2013

E.g.f.: 1/4 * (exp(4*x)-1) * exp(1/2*exp(2*x)+x-1/2).

A039765 Number of edges in the Hasse diagrams for the D-analogs of the partition lattices.

Original entry on oeis.org

0, 0, 4, 31, 240, 1931, 16396, 147589, 1408224, 14214559, 151394940, 1696783221, 19958826080, 245788962199, 3161635135340, 42390110260685, 591257152058944, 8563898444592927, 128598641049231996

Offset: 0

Ruedi Suter (suter(AT)math.ethz.ch)

R. Suter, Two analogues of a classical sequence, J. Integer Sequences, Vol. 3 (2000), #P00.1.8.

Edges in the Hasse diagrams for partition lattices: A003128, B-analogs = A039759.

max = 18; e[n_, x_] := E^(n*x)/n; f[n_, x_] := (E^(n*x) - 1)/n; g[n_, x_] := (E^(n*x) - 1 - n*x)/n; se = Series[ f[4, x]*g[1, x]*e[1, f[2, x]] + e[1, x]*g[4, x]*e[1, g[2, x]], {x, 0, max}]; CoefficientList[se, x]*Range[0, max]! (* Jean-François Alcover, May 04 2012, after e.g.f. *)

E.g.f.: f_4(x)*g_1(x)*e_1(f_2(x)) + e_1(x)*g_4(x)*e_1(g_2(x)) where e_n(x) = 1/n exp(n x); f_n(x) = 1/n (exp(n x) - 1); g_n(x) = 1/n (exp(n x) - 1 - n x).

A346842 E.g.f.: exp(exp(x) - 1) * (exp(x) - 1)^3 / 3!.

Original entry on oeis.org

1, 10, 75, 520, 3556, 24626, 174805, 1279240, 9677151, 75750752, 613656836, 5142797660, 44557627661, 398786697398, 3683575764083, 35084121263136, 344242894197456, 3476490965903174, 36104281709286841, 385257741260565844, 4220537246457019687, 47432055430482106880

Offset: 3

Ilya Gutkovskiy, Aug 05 2021

nonn

Cf. A000110, A000292, A000392, A003128, A005493, A049020, A189924, A346843, A346844.

b:= proc(n, m) option remember;
     `if`(n=0, binomial(m, 3), m*b(n-1, m)+b(n-1, m+1))
    end:
a:= n-> b(n, 0):
seq(a(n), n=3..24);  # Alois P. Heinz, Aug 05 2021

nmax = 24; CoefficientList[Series[Exp[Exp[x] - 1] (Exp[x] - 1)^3/3!, {x, 0, nmax}], x] Range[0, nmax]! // Drop[#, 3] &
Table[Sum[StirlingS2[n, k] Binomial[k, 3], {k, 0, n}], {n, 3, 24}]
Table[Sum[Binomial[n, k] StirlingS2[k, 3] BellB[n - k], {k, 0, n}], {n, 3, 24}]
Table[(BellB[n+3] - 6*BellB[n+2] + 8*BellB[n+1] - BellB[n])/6, {n, 3, 24}] (* Vaclav Kotesovec, Aug 06 2021 *)

my(x='x+O('x^25)); Vec(serlaplace(exp(exp(x)-1)*(exp(x)-1)^3/3!)) \\ Michel Marcus, Aug 06 2021

a(n) = Sum_{k=0..n} Stirling2(n,k) * binomial(k,3).
a(n) = Sum_{k=0..n} binomial(n,k) * Stirling2(k,3) * Bell(n-k).
a(n) = (Bell(n+3) - 6*Bell(n+2) + 8*Bell(n+1) - Bell(n))/6. - Vaclav Kotesovec, Aug 06 2021
a(n) ~ exp(-1 - n + n/LambertW(n)) * (n - LambertW(n))^3 * n^n / (6 * sqrt(1 + LambertW(n)) * LambertW(n)^(n+3)). - Vaclav Kotesovec, Jun 28 2022

A346843 E.g.f.: exp(exp(x) - 1) * (exp(x) - 1)^4 / 4!.

Original entry on oeis.org

1, 15, 155, 1400, 11991, 101031, 853315, 7300260, 63641006, 567304452, 5181338526, 48538121450, 466611951261, 4603782469653, 46613101232933, 484188586821376, 5157850655391981, 56321812548867229, 630125374420189131, 7219368394888423554, 84658119388335562972

Offset: 4

Ilya Gutkovskiy, Aug 05 2021

nonn

Cf. A000110, A000332, A000453, A003128, A005493, A049020, A346842, A346844.

b:= proc(n, m) option remember;
     `if`(n=0, binomial(m, 4), m*b(n-1, m)+b(n-1, m+1))
    end:
a:= n-> b(n, 0):
seq(a(n), n=4..24);  # Alois P. Heinz, Aug 05 2021

nmax = 24; CoefficientList[Series[Exp[Exp[x] - 1] (Exp[x] - 1)^4/4!, {x, 0, nmax}], x] Range[0, nmax]! // Drop[#, 4] &
Table[Sum[StirlingS2[n, k] Binomial[k, 4], {k, 0, n}], {n, 4, 24}]
Table[Sum[Binomial[n, k] StirlingS2[k, 4] BellB[n - k], {k, 0, n}], {n, 4, 24}]
Table[(BellB[n] - 24*BellB[n+1] + 29*BellB[n+2] - 10*BellB[n+3] + BellB[n+4])/24, {n, 4, 24}] (* Vaclav Kotesovec, Aug 06 2021 *)
With[{nn=30},Drop[CoefficientList[Series[(Exp[Exp[x]-1](Exp[x]-1)^4)/4!,{x,0,nn}],x] Range[0,nn]!,4]] (* Harvey P. Dale, Oct 03 2024 *)

my(x='x+O('x^25)); Vec(serlaplace(exp(exp(x)-1)*(exp(x)-1)^4/4!)) \\ Michel Marcus, Aug 06 2021

a(n) = Sum_{k=0..n} Stirling2(n,k) * binomial(k,4).
a(n) = Sum_{k=0..n} binomial(n,k) * Stirling2(k,4) * Bell(n-k).
a(n) = (Bell(n) - 24*Bell(n+1) + 29*Bell(n+2) - 10*Bell(n+3) + Bell(n+4))/24. - Vaclav Kotesovec, Aug 06 2021

A346844 E.g.f.: exp(exp(x) - 1) * (exp(x) - 1)^5 / 5!.

Original entry on oeis.org

1, 21, 287, 3290, 34671, 350889, 3492511, 34669734, 346231886, 3497726232, 35872743270, 374387203190, 3982122624117, 43207791878715, 478532965417529, 5411213661200830, 62482405993313229, 736696756305382411, 8868148033487285103, 108969560832001750716

Offset: 5

Ilya Gutkovskiy, Aug 05 2021

nonn

Cf. A000110, A000389, A000481, A003128, A005493, A049020, A094816, A346842, A346843.

b:= proc(n, m) option remember;
     `if`(n=0, binomial(m, 5), m*b(n-1, m)+b(n-1, m+1))
    end:
a:= n-> b(n, 0):
seq(a(n), n=5..24);  # Alois P. Heinz, Aug 05 2021

nmax = 24; CoefficientList[Series[Exp[Exp[x] - 1] (Exp[x] - 1)^5/5!, {x, 0, nmax}], x] Range[0, nmax]! // Drop[#, 5] &
Table[Sum[StirlingS2[n, k] Binomial[k, 5], {k, 0, n}], {n, 5, 24}]
Table[Sum[Binomial[n, k] StirlingS2[k, 5] BellB[n - k], {k, 0, n}], {n, 5, 24}]
Table[(-BellB[n] + 89*BellB[n+1] - 145*BellB[n+2] + 75*BellB[n+3] - 15*BellB[n+4] + BellB[n+5])/120, {n, 5, 24}] (* Vaclav Kotesovec, Aug 06 2021 *)

my(x='x+O('x^25)); Vec(serlaplace(exp(exp(x)-1)*(exp(x)-1)^5/5!)) \\ Michel Marcus, Aug 06 2021

a(n) = Sum_{k=0..n} Stirling2(n,k) * binomial(k,5).
a(n) = Sum_{k=0..n} binomial(n,k) * Stirling2(k,5) * Bell(n-k).
a(n) = (-Bell(n) + 89*Bell(n+1) - 145*Bell(n+2) + 75*Bell(n+3) - 15*Bell(n+4) + Bell(n+5))/120. - Vaclav Kotesovec, Aug 06 2021

cp's OEIS Frontend

A005493 2-Bell numbers: a(n) = number of partitions of [n+1] with a distinguished block.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A049020 Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

Extensions

A123158 Square array related to Bell numbers read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A003129 Number of transfer impedances of an n-terminal network.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A003130 Impedances of an n-terminal network.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

Extensions

A039759 Number of edges in the Hasse diagrams for the B-analogs of the partition lattices.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula