Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138352
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138352 Table read by antidiagonals: T(n,k) is the number of transitive directed multigraphs with loops with n arcs and k vertices. +0
3
1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 5, 1, 0, 1, 2, 8, 8, 1, 0, 1, 2, 9, 20, 14, 1, 0, 1, 2, 9, 29 (list; table; graph; listen)
OFFSET

0,8

COMMENT

Partial sums of the rows of A139623, i.e., T(n,k) = sum(T139623(n,p),p=0..k).

If k>=2n, T(n,k) = A139628(n).

CROSSREFS

Cf. A138107.

Sequence in context: A145895 A114503 A103528 this_sequence A129620 A074766 A138107

Adjacent sequences: A138349 A138350 A138351 this_sequence A138353 A138354 A138355

KEYWORD

nonn,tabl

AUTHOR

Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 07 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research