id:A143842 - OEIS Search Results

Search: id:A143842

Displaying 1-1 of 1 results found.

page 1

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).

+0
2

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; listen)

	OFFSET	`0,26`
	COMMENT	`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).`
	CROSSREFS	`Cf. A138352, A136868, A143841.` `Sequence in context: A100544 A130654 A053259 this_sequence A092876 A024940 A054635` `Adjacent sequences: A143839 A143840 A143841 this_sequence A143843 A143844 A143845`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Benoit Jubin (benoit_jubin(AT)yahoo.fr), Sep 02 2008`

page 1

Search completed in 0.002 seconds

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.

AT&T Labs Research