id:A139622 - OEIS Search Results

Search: id:A139622

Displaying 1-1 of 1 results found.

page 1

Table read by rows: T(n,k) is the number of strongly connected directed multigraphs with loops and no vertex of degree 0,with n arcs and k vertices.

+0
4

1, 1, 1, 1, 2, 1, 1, 6 (list; table; graph; listen)

	OFFSET	`1,5`
	COMMENT	`T(n,1) = T(n,n) = 1, T(n,2) = T139621(n,2) - n(n+1)/2.` `Row sums: A139627.`
	CROSSREFS	`Cf. A136564, A139621.` `Adjacent sequences: A139619 A139620 A139621 this_sequence A139623 A139624 A139625` `Sequence in context: A098315 A036563 A025264 this_sequence A152656 A096162 A053383`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 01 2008`

page 1

Search completed in 0.002 seconds

Last modified November 3 12:59 EST 2009. Contains 165766 sequences.