Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).
1, 1, 2, 1, 6, 6, 1, 14, 36, 24, 1, 30, 150, 240, 120, 1, 62, 540, 1560, 1800, 720, 1, 126
2 seqfan posts
Sun Jun 27 23:38:32 CEST 2010 [seqfan] Stirling-2 Numbers and dropping times of the Collatz Conjecture