OFFSET
1,3
COMMENTS
Permuting the colors does not change the coloring. T(n,k) is the number of ways to partition the vertices into k independent sets.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..2500 (rows 1..50)
Eric Weisstein's World of Mathematics, Complete Bipartite Graph.
Eric Weisstein's World of Mathematics, Vertex Coloring.
FORMULA
T(n,k) = Sum_{j=1..k-1} Stirling2(n,j)*Stirling2(n,k-j).
T(n,k) = A274310(2*n-1, k-1).
n-th row polynomial R(n, x) = Bell(n, x)^2, where Bell(n, x) is the n-th row polynomial of the triangle of Stirling numbers of the second kind A008277. - Peter Bala, Nov 11 2025
EXAMPLE
Triangle begins (n >= 1, k >= 2):
1;
1, 2, 1;
1, 6, 11, 6, 1;
1, 14, 61, 86, 50, 12, 1;
1, 30, 275, 770, 927, 530, 150, 20, 1;
1, 62, 1141, 5710, 12160, 12632, 6987, 2130, 355, 30, 1;
...
MAPLE
A384968 := proc (n, k) local j;
with(combinat):
add(Stirling2(n, j)*Stirling2(n, k-j), j = 1..k-1);
end proc:
for n from 1 to 10 do
seq(A384968(n, k), k = 2..2*n);
end do; # Peter Bala, Nov 11 2025
PROG
(PARI) T(n, k) = sum(j=1, k-1, stirling(n, j, 2)*stirling(n, k-j, 2))
for(n=1, 7, print(vector(2*n-1, k, T(n, k+1))))
CROSSREFS
KEYWORD
nonn,tabf,easy
AUTHOR
Andrew Howroyd, Jun 18 2025
STATUS
approved
