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

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, 2644, 1122, 0, 0, 0, 32, 1728, 12096, 19456, 7008

Offset

1,3

Links

Table of n, a(n) for n=1..36.

C. Barrientos and S. M. Minion, Enumerating families of labeled graphs, J. Integer Seq., 18(2015), article 15.1.7.

Example

Triangle begins:
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,2644,1122,
0,0,0,32,1728,12096,19456,7008,
...

Crossrefs

Sequence in context: A099040 A185296 A136717 * A136716 A117946 A061930

Adjacent sequences: A261682 A261683 A261684 * A261686 A261687 A261688

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Sep 06 2015

Status

approved