Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,8

COMMENT

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

T(n,2) = T138107(n,2) - floor(n/2).

If k >= n+1, T(n,k) = A137975(n).

CROSSREFS

Cf. A138107.

Adjacent sequences: A129617 A129618 A129619 this_sequence A129621 A129622 A129623

Sequence in context: A114503 A103528 A138352 this_sequence A074766 A138107 A089631

KEYWORD

nonn,tabl

AUTHOR

Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 06 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 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research