Irregular triangle read by rows: T(n,k) (n>=2, k>=1) is the number of strong digraphs on n nodes with k descents.
A339807
Irregular triangle read by rows: T(n,k) (n>=2, k>=1) is the number of strong digraphs on n nodes with k descents.
Terms
- a(0) =1a(1) =2a(2) =11a(3) =5a(4) =10a(5) =154a(6) =540a(7) =581a(8) =272a(9) =49a(10) =122a(11) =3418a(12) =27304a(13) =90277a(14) =150948a(15) =150519a(16) =95088a(17) =37797a(18) =8714a(19) =893a(20) =3346a(21) =142760a(22) =1938178a(23) =12186976a(24) =42696630a(25) =94605036a(26) =145009210a(27) =161845163a(28) =134933733a(29) =84656743
External references
- oeis: A339807