Irregular triangle read by rows: row n gives number of connected graphs on n nodes with forcing number k (n>=1, k>=0).
A256980
Irregular triangle read by rows: row n gives number of connected graphs on n nodes with forcing number k (n>=1, k>=0).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =4a(6) =8a(7) =11a(8) =2a(9) =35a(10) =68a(11) =9a(12) =252a(13) =524a(14) =75a(15) =2a(16) =2994a(17) =7161a(18) =934a(19) =28a(20) =68665a(21) =171684a(22) =20296a(23) =432a(24) =3a(25) =3013075a(26) =7849829a(27) =840786a(28) =12766a(29) =115
External references
- oeis: A256980