Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the star graph S_n (having n vertices).
A235114
Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the star graph S_n (having n vertices).
Terms
- a(0) =1a(1) =1a(2) =3a(3) =1a(4) =1a(5) =6a(6) =10a(7) =6a(8) =1a(9) =1a(10) =9a(11) =28a(12) =40a(13) =28a(14) =9a(15) =1a(16) =1a(17) =12a(18) =55a(19) =129a(20) =170a(21) =129a(22) =55a(23) =12a(24) =1a(25) =1a(26) =15a(27) =91a(28) =300a(29) =597
External references
- oeis: A235114