1060976
domain: N
Appears in sequences
- 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).at n=15A161000
- Least integer, k, whose value is n in A165413.at n=5A165933
- Number of ways of placing A352241(n) nonattacking black-square queens on an n X n board.at n=24A352325