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 A350788 #13 Jan 18 2022 06:01:18 %S A350788 1,1,1,1,4,2,2,1,9,9,18,3,18,6,1,16,24,72,16,144,96,4,48,36,144,24,1, %T A350788 25,50,200,50,600,600,25,400,300,1800,600,5,100,200,600,900,1200,120, %U A350788 1,36,90,450,120,1800,2400,90,1800,1350,10800,5400,36,900,1800,7200,10800,21600,4320,6,180,450,1800,300,7200,7200,1800,16200,10800,720 %N A350788 Irregular triangle read by rows: T(n,k) is the number of partial functions on [n] such that the sizes of the preimages of the individual elements in the range form the k-th partition in the class of all partitions listed in Abramowitz and Stegun order, n>=0, 0<=k<=A000070(n). %C A350788 The last A000041(n) entries of each row give A049009. %C A350788 Row sums are (n+1)^n = A000169(n+1). %e A350788 1, %e A350788 1, 1, %e A350788 1, 4, 2, 2, %e A350788 1, 9, 9, 18, 3, 18, 6, %e A350788 1, 16, 24, 72, 16, 144, 96, 4, 48, 36, 144, 24 %t A350788 g[n_, list_] := Multinomial @@ Join[{n - Length[list]}, Table[Count[list, i], {i, 1, n}]]* Multinomial @@ Join[{n - Total[list]}, list]; Table[Map[g[nn, #] &, %t A350788 Level[Table[IntegerPartitions[k], {k, 0, nn}], {2}]], {nn, 0, 5}] // Grid %Y A350788 Cf. A000169, A049009, A000041, A000070. %K A350788 nonn,tabf %O A350788 0,5 %A A350788 _Geoffrey Critzer_, Jan 16 2022