login
Triangle read by rows: T(n,m) = number of beta-labeled graphs of size n and order m (n>=1, 2<=m<=n+1).
0

%I #10 Sep 06 2015 13:56:21

%S 1,0,2,0,2,4,0,0,12,12,0,0,8,68,44,0,0,2,106,406,206,0,0,0,88,1186,

%T 2644,1122,0,0,0,32,1728,12096,19456,7008

%N Triangle read by rows: T(n,m) = number of beta-labeled graphs of size n and order m (n>=1, 2<=m<=n+1).

%H C. Barrientos and S. M. Minion, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Minion/minion3.html">Enumerating families of labeled graphs</a>, J. Integer Seq., 18(2015), article 15.1.7.

%e Triangle begins:

%e 1,

%e 0,2,

%e 0,2,4,

%e 0,0,12,12,

%e 0,0,8,68,44,

%e 0,0,2,106,406,206,

%e 0,0,0,88,1186,2644,1122,

%e 0,0,0,32,1728,12096,19456,7008,

%e ...

%K nonn,tabl,more

%O 1,3

%A _N. J. A. Sloane_, Sep 06 2015