Triangle read by rows: T(n,k) is the number of strong subtrees of height k in the complete binary tree of height n.

A374839

Triangle read by rows: T(n,k) is the number of strong subtrees of height k in the complete binary tree of height n.

Terms

    a(0) =1a(1) =3a(2) =1a(3) =7a(4) =7a(5) =1a(6) =15a(7) =35a(8) =23a(9) =1a(10) =31a(11) =155a(12) =403a(13) =279a(14) =1a(15) =63a(16) =651a(17) =6603a(18) =71827a(19) =65815a(20) =1a(21) =127a(22) =2667a(23) =106299a(24) =18394315a(25) =4313323667a(26) =4295033111a(27) =1a(28) =255a(29) =10795

External references