Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139621
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139621 Table read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices. +0
5
1, 1, 1, 4, 3, 1, 8, 15, 8, 1, 16 (list; graph; listen)
OFFSET

1,4

COMMENT

Length of the n^th row: n+1.

T(n,1) = 1, T(n,2) = T139654(n,2) - floor(n/2), T(n,n+1) = A022017(n).

Row sums: A139626.

LINKS

B. Jubin, Sequences contributed to the OEIS.

CROSSREFS

Cf. A136564, A139622.

Adjacent sequences: A139618 A139619 A139620 this_sequence A139622 A139623 A139624

Sequence in context: A038763 A128007 A098458 this_sequence A123160 A039758 A109692

KEYWORD

nonn

AUTHOR

Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 01 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 July 4 09:27 EDT 2009. Contains 160562 sequences.


AT&T Labs Research