Suter, Ruedi Two analogues of a classical sequence. (English) Zbl 1004.05002 J. Integer Seq. 3, No. 1, Art. 00.1.8, 18 p. (2000). Summary: We compute exponential generating functions for the numbers of edges in the Hasse diagrams for the \(B\)- and \(D\)-analogues of the partition lattices. Cited in 13 Documents MSC: 05A15 Exact enumeration problems, generating functions 05A18 Partitions of sets 05B35 Combinatorial aspects of matroids and geometric lattices 06A07 Combinatorics of partially ordered sets Software:OEIS PDFBibTeX XMLCite \textit{R. Suter}, J. Integer Seq. 3, No. 1, Art. 00.1.8, 18 p. (2000; Zbl 1004.05002) Full Text: EuDML EMIS Online Encyclopedia of Integer Sequences: Number of driving-point impedances of an n-terminal network. Dowling numbers: e.g.f.: exp(x + (exp(b*x) - 1)/b) with b=2. Triangle of B-analogs of Stirling numbers of the second kind. Triangle of B-analogs of Stirling numbers of 2nd kind. Triangle of coefficients in expansion of (x-1)*(x-3)*(x-5)*...*(x-(2*n-1)). Triangle of B-analogs of Stirling numbers of first kind. Number of edges in the Hasse diagrams for the B-analogs of the partition lattices. Triangle of D-analogs of Stirling numbers of the 2nd kind. Triangle of D-analogs of Stirling numbers of 2nd kind. Triangle of D-analogs of Stirling numbers of first kind. Triangle of D-analogs of Stirling numbers of first kind. D-analogs of Bell numbers. Number of edges in the Hasse diagrams for the D-analogs of the partition lattices. Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows. E.g.f. exp(-x)*exp(exp(2*x)/2-1/2)/2 + 1/2.