login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 0
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 (list; table; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 08:08 EDT 2020. Contains 335520 sequences. (Running on oeis4.)