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 A144280 #13 Jul 02 2023 12:48:07 %S A144280 1,3,1,21,3,1,231,30,3,1,3465,294,30,3,1,65835,4599,321,30,3,1, %T A144280 1514205,81081,4788,321,30,3,1,40883535,1837836,84483,4869,321,30,3,1, %U A144280 1267389585,47609100,1892835,85050,4869,321,30,3,1,44358635475,1449052605,48681864 %N A144280 Lower triangular array called S2hat(-3) related to partition number array A144279. %C A144280 If in the partition array M32khat(-3)= A144279 entries with the same parts number m are summed one obtains this triangle of numbers S2hat(-3). In the same way the Stirling2 triangle A008277 is obtained from the partition array M_3 = A036040. %C A144280 The first three columns are A008545, A144282, A144283. %H A144280 Wolfdieter Lang, <a href="/A144280/a144280.txt">First 10 rows of the array and more</a>. %H A144280 Wolfdieter Lang, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL12/Lang/lang.html">Combinatorial Interpretation of Generalized Stirling Numbers</a>, J. Int. Seqs. Vol. 12 (2009) 09.3.3. %F A144280 a(n,m) = Sum_{q=1..p(n,m)} Product_{j=1..n} |S2(-3;j,1)|^e(n,m,q,j) if n>=m>=1, else 0. Here p(n,m)=A008284(n,m), the number of m parts partitions of n and e(n,m,q,j) is the exponent of j in the q-th m part partition of n. |S2(-3,n,1)|= A000369(n,1) = A008545(n-1) = (4*n-5)(!^4) (4-factorials) for n>=2 and 1 if n=1. %e A144280 Triangle begins: %e A144280 [1]; %e A144280 [3,1]; %e A144280 [21,3,1]; %e A144280 [231,30,3,1]; %e A144280 [3465,294,30,3,1]; %e A144280 ... %Y A144280 Cf. A144279, A008277, A036040, A008284, A000369, A008545, A144282, A144283. %Y A144280 Row sums A144281. %Y A144280 Cf. A144275 (S2hat(-2)). %K A144280 nonn,easy,tabl %O A144280 1,2 %A A144280 _Wolfdieter Lang_, Oct 09 2008