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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A139622 Table read by rows: T(n,k) is the number of strongly connected directed multigraphs with loops, with n arcs and k vertices. 3
 1, 1, 1, 1, 2, 1, 1, 6, 4, 1, 1, 10, 19, 6, 1, 1, 19, 73, 59, 9, 1, 1, 28, 208, 350, 138, 12, 1, 1, 44, 534, 1670, 1361 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS R. J. Mathar, Statistics on Small Graphs, arXiv:1709.09000 (2017) Table 73. FORMULA T(n,1) = T(n,n) = 1. T(n,2) = A139621(n,2) - n(n+1)/2. EXAMPLE Triangle begins:     1     1    1     1    2    1     1    6    4    1     1   10   19    6    1     1   19   73   59    9    1     1   28  208  350  138   12    1     1   44  534 1670 1361    .    .    1 T(4 edges, 2 vertices)=6: one graph 1->1, 1->1, 2->1, 1->2; one graph 1->1, 2->1, 2->1, 1->2; one graph 1->1, 1->2, 1->2, 2->1; one graph 1->1, 1->2, 2->1, 2->2; one graph 2->1, 2->1, 2->1, 1->2; one graph 1->2, 1->2, 2->1, 2->1. T(4 edges, 3 vertices)=4: one graph 1->1, 2->1, 3->2, 1->3; one graph 2->1, 2->1, 3->2, 1->3; one graph 2->1, 3->1, 1->2, 1->3; one graph 2->1, 3->1, 1->2, 2->3. CROSSREFS Cf. A136564, A139621, A139627 (row sums). Sequence in context: A186287 A318393 A340128 * A257895 A186023 A103880 Adjacent sequences:  A139619 A139620 A139621 * A139623 A139624 A139625 KEYWORD nonn,tabl,more AUTHOR Benoit Jubin, May 01 2008 EXTENSIONS More terms from R. J. Mathar, Aug 11 2017 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.

Last modified May 7 22:52 EDT 2021. Contains 343652 sequences. (Running on oeis4.)