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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143842 Table read by antidiagonals: T(n,k) is the number of strongly connected directed multigraphs with loops with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points). 1
 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 2, 3, 1, 0, 1, 1, 1, 1, 2, 3, 7, 1, 0, 1, 1, 1, 1, 2, 3, 7, 11, 1, 0, 1, 1, 1, 1, 2, 3, 7, 11, 20, 1, 0, 1, 1, 1, 1, 2, 3, 7, 11, 20, 29, 1, 0, 1, 1, 1, 1, 2, 3, 7, 11, 20, 30, 45, 1, 0, 1, 1, 1, 1, 2, 3, 7, 11, 20 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,26 COMMENTS Partial sums of the rows of A139625, i.e., T(n,k) = sum(T139625(n,p),p=0..k). If k>=floor(sqrt(n)), T(n,k) = A139630(n). LINKS CROSSREFS Cf. A138352, A136868, A143841. Sequence in context: A273107 A194329 A321749 * A092876 A187360 A334368 Adjacent sequences:  A143839 A143840 A143841 * A143843 A143844 A143845 KEYWORD nonn,tabl AUTHOR Benoit Jubin, Sep 02 2008 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 December 6 20:22 EST 2021. Contains 349567 sequences. (Running on oeis4.)