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 A159749 #7 Jun 17 2019 04:20:05
%S A159749 2,2,4,2,12,16,0,24,96,96,-8,0,320,960,768,0,-240,0,4800,11520,7680,
%T A159749 240,0,-6720,0,80640,161280,92160,0,13440,0,-188160,0,1505280,2580480,
%U A159749 1290240,-24192,0,645120,0,-5419008,0,30965760,46448640,20643840
%N A159749 The decomposition of a certain labeled universe (A052584), triangle read by rows.
%C A159749 T(n,k) is a weighted binomial sum of the Bernoulli numbers A027641/A027642 with A027641(1) = 1, which amounts to the definition B_{n} = B_{n}(1).
%F A159749 T(n,k) = (n+1)!*C(n,k)*B_{n-k}*2^(k+1)/(k+1).
%F A159749 T(n,n) = A066318(n+1) = n!*2^(n+1) (necklaces with n labeled beads of 2 colors; see also A032184).
%F A159749 Sum_{k=0..n} T(n,k) = A052584(n+1) = (n+1)!*(1+2^n).
%e A159749 2
%e A159749 2, 4
%e A159749 2, 12, 16
%e A159749 0, 24, 96, 96
%e A159749 -8, 0, 320, 960, 768
%e A159749 0, -240, 0, 4800, 11520, 7680
%e A159749 240, 0, -6720, 0, 80640, 161280, 92160
%p A159749 T := (n,k) -> (n+1)!*binomial(n,k)*bernoulli(n-k,1)*2^(k+1)/(k+1);
%t A159749 T[n_, k_] := (n+1)! Binomial[n, k] BernoulliB[n-k, 1] 2^(k+1)/(k+1);
%t A159749 Table[T[n, k], {n, 0, 8}, {k, 0, n}] (* _Jean-François Alcover_, Jun 17 2019 *)
%Y A159749 Cf. A027641, A027642, A052584.
%K A159749 sign,tabl
%O A159749 0,1
%A A159749 _Peter Luschny_, Apr 20 2009