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 A368583 #6 Jan 22 2024 05:53:59 %S A368583 1,0,2,0,3,12,0,8,60,120,0,30,330,1260,1680,0,144,2100,11760,30240, %T A368583 30240,0,840,15344,113400,428400,831600,665280,0,5760,127008,1169280, %U A368583 5821200,16632000,25945920,17297280,0,45360,1176120,13000680,80415720,302702400,696215520,908107200,518918400 %N A368583 Table read by rows: T(n, k) = A124320(n + 1, k) * A132393(n, k). %e A368583 Triangle starts: %e A368583 [0] [1] %e A368583 [1] [0, 2] %e A368583 [2] [0, 3, 12] %e A368583 [3] [0, 8, 60, 120] %e A368583 [4] [0, 30, 330, 1260, 1680] %e A368583 [5] [0, 144, 2100, 11760, 30240, 30240] %e A368583 [6] [0, 840, 15344, 113400, 428400, 831600, 665280] %o A368583 (SageMath) %o A368583 def Trow(n): return [rising_factorial(n+1, k)*stirling_number1(n, k) %o A368583 for k in range(n+1)] %o A368583 for n in range(7): print(Trow(n)) %Y A368583 Cf. A124320 (rising factorial), A132393 (unsigned Stirling1), A001813 (main diagonal), A052819 (row sums), A227457 (alternating row sums), A368584. %K A368583 nonn,tabl %O A368583 0,3 %A A368583 _Peter Luschny_, Jan 10 2024