38958

Appears in sequences

• Number of 4-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=4.at n=17A027559
• Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is 1/(2*n) times the number of n-colorings of the complete tripartite graph K_(k,k,k).at n=49A212221
• Number of subsets of {1..n} containing n such that no element is a sum of distinct other elements. A variation of non-binary sum-free subsets without re-usable elements.at n=26A365071
• Brent's irregular triangle T[r,k] related to Hardy-Littlewood constants of prime gaps 2r.at n=61A381083
• Column k=3 of Brent's table A381083 related to prime gaps 2n.at n=14A381086