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 ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).
A235117
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 ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).
Terms
- a(0) =1a(1) =1a(2) =6a(3) =10a(4) =6a(5) =1a(6) =1a(7) =12a(8) =54a(9) =124a(10) =162a(11) =124a(12) =54a(13) =12a(14) =1a(15) =1a(16) =18a(17) =134a(18) =556a(19) =1451a(20) =2530a(21) =3036a(22) =2530a(23) =1451a(24) =556a(25) =134a(26) =18a(27) =1a(28) =1a(29) =24
External references
- oeis: A235117