login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139623 Table read by rows: T(n,k) is the number of directed multigraphs with loops and no vertex of degree 0, 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). 4
1, 1, 1, 4, 3, 1, 1, 7, 12, 9, 3, 1, 1, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Length of the n^th row: 2n.
T(n,1) = T(n,2n) = 1 and T(n,2n-1) = 3 if n>1.
Row sums: A139628.
LINKS
EXAMPLE
Triangle begins
1, 1;
1, 4, 3, 1;
1, 7, 12, 9, 3, 1;
CROSSREFS
Sequence in context: A157464 A046546 A189967 * A278072 A358710 A216482
KEYWORD
nonn,tabf,more
AUTHOR
Benoit Jubin, May 01 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:26 EDT 2024. Contains 371967 sequences. (Running on oeis4.)