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!)
A245796 T(n,k) is the number of labeled graphs of n vertices and k edges that have endpoints, where an endpoint is a vertex with degree 1. 3
0, 1, 3, 3, 6, 15, 16, 12, 10, 45, 110, 195, 210, 120, 20, 15, 105, 435, 1320, 2841, 4410, 4845, 3360, 1350, 300, 30, 21, 210, 1295, 5880, 19887, 51954, 106785, 171360, 208565, 186375, 120855, 56805, 19110, 4410, 630, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
The length of the rows are 1,1,2,4,7,11,16,22,...: (1+(n-1)*(n-2)/2) = A152947(n).
T(n,k) = 0 if k > (n-1)*(n-2)/2 + 1.
Let j = (n-1)*(n-2)/2. For i >=0, n >= 4+i, T(n,j-i+1) = n*(n-1)*binomial(j,i).
For k <= 3, T(n,k) is equal to the number of labeled bipartite graphs with n vertices and k edges. In particular, T(n,1) = A000217(n-1), T(n,2) = A050534(n) and T(n,3) = A053526(n).
LINKS
EXAMPLE
Triangle starts:
..0
..1
..3......3
..6.....15.....16.....12
.10.....45....110....195....210....120.....20
.15....105....435...1320...2841...4410...4845...3360...1350....300.....30
...
CROSSREFS
Sum of n-th row is A245797(n).
Sequence in context: A143418 A336452 A092370 * A345908 A006807 A298180
KEYWORD
nonn,tabf
AUTHOR
Chai Wah Wu, Aug 01 2014
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 March 28 08:02 EDT 2024. Contains 371236 sequences. (Running on oeis4.)