229856
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=17A161000
- Number of 1:3:sqrt(10) proportioned triangles on a (n+1) X (n+1) grid.at n=32A190102
- Number of subsets of {1..n} (including empty set) such that the pairwise products of distinct elements are all distinct.at n=20A196724