This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143841 Table read by antidiagonals: T(n,k) is the number of strongly connected directed multigraphs with loops with n arcs and k vertices. 1
 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 4, 7, 1, 0, 1, 1, 2, 4 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,13 COMMENTS Partial sums of the rows of A139622, i.e., T(n,k) = sum(T139622(n,p),p=0..k). T(n,2) = T129620(n,2) - n(n-1)/2. If k>=n, T(n,k) = A139627(n). LINKS CROSSREFS Cf. A138107, A129620, A143842. Sequence in context: A262553 A247506 A182172 * A276719 A276837 A269941 Adjacent sequences:  A143838 A143839 A143840 * A143842 A143843 A143844 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 January 19 09:35 EST 2019. Contains 319306 sequences. (Running on oeis4.)