This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A227341 #12 Dec 11 2015 22:11:46
%S A227341 1,1,1,0,2,1,0,2,4,1,0,2,10,7,1,0,2,22,31,11,1,0,2,46,115,75,16,1,0,2,
%T A227341 94,391,415,155,22,1,0,2,190,1267,2051,1190,287,29,1,0,2,382,3991,
%U A227341 9471,8001,2912,490,37,1,0,2,766,12355,41875,49476,25473,6342,786,46,1
%N A227341 Triangular array: Number of partitions of the vertex set of a forest of two trees on n vertices into k nonempty independent sets.
%C A227341 For a graph G and a positive integer k, the graphical Stirling number S(G;k) is the number of set partitions of the vertex set of G into k nonempty independent sets (an independent set in G is a subset of the vertices, no two elements of which are adjacent).
%C A227341 Here we take the graph G to be a forest of two trees on n vertices. The corresponding graphical Stirling numbers S(G;k) do not depend on the choice of the trees. See Galvin and Thanh. If the graph G is a single tree on n vertices then the graphical Stirling numbers S(G;k) are the classical Stirling numbers of the second kind A008277. See also A105794.
%H A227341 B. Duncan and R. Peele, <a href="https://cs.uwaterloo.ca/journals/JIS/">Bell and Stirling Numbers for Graphs</a>, Journal of Integer Sequences 12 (2009), article 09.7.1.
%H A227341 D. Galvin and D. T. Thanh, <a href="http://www.combinatorics.org/ojs/index.php/eljc/issue/view/Volume20-1">Stirling numbers of forests and cycles</a>, Electr. J. Comb. Vol. 20(1): P73 (2013)
%F A227341 T(n,k) = Stirling2(n-1,k-1) + Stirling2(n-2,k-1), n,k >= 1.
%F A227341 Recurrence equation: T(n,k) = (k-1)*T(n-1,k) + T(n-1,k-1). Cf. A105794.
%F A227341 k-th column o.g.f.: x^k*(1+x)/((1-x)*(1-2*x)*...*(1-(k-1)*x)).
%F A227341 For n >= 2, sum {k = 0..n} T(n,k)*x_(k) = x^2*(x-1)^(n-2), where x_(k) = x*(x-1)*...*(x-k+1) is the falling factorial.
%F A227341 Column 3: A033484; Column 4: A091344; Row sums are essentially A011968.
%e A227341 Triangle begins
%e A227341 n\k | 1 2 3 4 5 6 7
%e A227341 = = = = = = = = = = = = =
%e A227341 1 | 1
%e A227341 2 | 1 1
%e A227341 3 | 0 2 1
%e A227341 4 | 0 2 4 1
%e A227341 5 | 0 2 10 7 1
%e A227341 6 | 0 2 22 31 11 1
%e A227341 7 | 0 2 46 115 75 16 1
%e A227341 Connection constants: Row 5: 2*x*(x-1) + 10*x*(x-1)*(x-2) + 7*x*(x-1)*(x-2)*(x-3) + x*(x-1)*(x-2)*(x-3)*(x-4) = x^2*(x-1)^3.
%Y A227341 A008277, A011968 (row sums), A033484 (col. 3), A091344 (col. 4), A105794.
%K A227341 nonn,easy,tabl
%O A227341 1,5
%A A227341 _Peter Bala_, Jul 10 2013