Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143841
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A143841
%S A143841 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
%N A143841 Table read by antidiagonals: T(n,k) is the number of strongly connected 
               directed multigraphs with loops with n arcs and k vertices.
%C A143841 Partial sums of the rows of A139622, i.e., T(n,k) = sum(T139622(n,p),
               p=0..k).
%C A143841 T(n,2) = T129620(n,2) - n(n-1)/2.
%C A143841 If k>=n, T(n,k) = A139627(n).
%Y A143841 Cf. A138107, A129620, A143842.
%Y A143841 Sequence in context: A133734 A109702 A115412 this_sequence A035440 A029878 
               A080934
%Y A143841 Adjacent sequences: A143838 A143839 A143840 this_sequence A143842 A143843 
               A143844
%K A143841 nonn,tabl
%O A143841 0,13
%A A143841 Benoit Jubin (benoit_jubin(AT)yahoo.fr), Sep 02 2008

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research