|
%I #18 Aug 06 2019 07:35:04
%S 1,0,1,0,0,1,0,6,0,1,0,0,24,0,1,0,120,0,60,0,1,0,0,1080,0,120,0,1,0,
%T 5040,0,5040,0,210,0,1,0,0,80640,0,16800,0,336,0,1,0,362880,0,604800,
%U 0,45360,0,504,0,1,0,0,9072000,0,3024000,0,105840,0,720,0,1
%N Triangle read by rows: number of idempotent basis elements of rank k in Brauer monoid B_n.
%C Also the Bell transform of A005212(n+1). For the definition of the Bell transform see A264428. - _Peter Luschny_, Jan 29 2016
%H I. Dolinka, J. East, A. Evangelou, D. FitzGerald, N. Ham, et al., <a href="http://arxiv.org/abs/1408.2021">Enumeration of idempotents in diagram semigroups and algebras</a>, arXiv preprint arXiv:1408.2021 [math.GR], 2014.
%e Triangle begins:
%e 1,
%e 0, 1,
%e 0, 0, 1,
%e 0, 6, 0, 1,
%e 0, 0, 24, 0, 1,
%e 0, 120, 0, 60, 0, 1,
%e 0, 0, 1080, 0, 120, 0, 1,
%e 0, 5040, 0, 5040, 0, 210, 0, 1,
%e 0, 0, 80640, 0, 16800, 0, 336, 0, 1,
%e 0, 362880, 0, 604800, 0, 45360, 0, 504, 0, 1,
%e 0, 0, 9072000, 0, 3024000, 0, 105840, 0, 720, 0, 1,
%e ...
%p # The function BellMatrix is defined in A264428.
%p BellMatrix(n -> `if`(n::odd, 0, (n+1)!), 9); # _Peter Luschny_, Jan 29 2016
%t BellMatrix[f_, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
%t B = BellMatrix[Function[n, If[OddQ[n], 0, (n + 1)!]], rows = 12];
%t Table[B[[n, k]], {n, 1, rows}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Jun 28 2018, after _Peter Luschny_ *)
%Y Cf. A005212, A264428.
%K nonn,tabl
%O 0,8
%A _N. J. A. Sloane_, Mar 14 2015
|
