|
Search: id:A138107
|
|
|
| A138107 |
|
Table read by antidiagonals: T(n,k) is the number of directed multigraphs with loops with n arcs and k vertices. |
|
+0
5
|
|
| 1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 6, 1, 0, 1, 2, 10, 10, 1, 0, 1, 2, 11, 31, 19, 1, 0, 1, 2, 11, 47, 90, 28, 1, 0, 1, 2, 11, 51, 198, 222, 44, 1, 0, 1, 2, 11, 52, 269, 713, 520, 60, 1, 0, 1, 2, 11, 52, 291, 1270, 2423, 1090, 85, 1, 0, 1, 2, 11, 52, 295, 1596, 5776, 7388, 2180, 110, 1, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
Partial sums of the rows of A136564, i.e., T(n,k) = sum(T136564(n,p),p=0..k).
T(n,0)=A000007(n), T(n,1)=A000012(n), T(n,2)= A005993(n), T(n,3)= A050927(n), T(n,4)= A050929(n).
If k>=2n, T(n,k)=A052171(n).
|
|
CROSSREFS
|
Sequence in context: A138352 A129620 A074766 this_sequence A089631 A129558 A131185
Adjacent sequences: A138104 A138105 A138106 this_sequence A138108 A138109 A138110
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Benoit Jubin (benoit_jubin(AT)yahoo.fr), May 03 2008
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic and Benoit Jubin (benoit_jubin(AT)yahoo.fr), Sep 10 2008
|
|
|
Search completed in 0.002 seconds
|
