Triangle read by rows: For 1 <= m <= n, t(n,m) = the smallest positive integer that when read in binary contains exactly (n+1-m) runs of 0's and 1's, all runs being of distinct lengths m through n in any order within binary t(n,m).

A161000

Triangle read by rows: For 1 <= m <= n, t(n,m) = the smallest positive integer that when read in binary contains exactly (n+1-m) runs of 0's and 1's, all runs being of distinct lengths m through n in any order within binary t(n,m).

Terms

    a(0) =1a(1) =4a(2) =3a(3) =35a(4) =24a(5) =7a(6) =536a(7) =391a(8) =112a(9) =15a(10) =16775a(11) =12400a(12) =3599a(13) =480a(14) =31a(15) =1060976a(16) =790031a(17) =229856a(18) =30751a(19) =1984a(20) =63a(21) =135007759a(22) =100893152a(23) =29390879a(24) =3934144a(25) =254015a(26) =8064a(27) =127a(28) =34460631520a(29) =25799194655

External references