20356

Appears in sequences

• Number of 3-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=3.at n=18A027557
• Triangle formed when the cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows from left to right.at n=29A059433
• Triangle formed when cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows in natural order.at n=29A059434
• Number of permissible patterns of primes in a fixed interval of n consecutive integers.at n=37A094660
• A Binet like formula using the Akiyama-Thurston tile roots for a Minimal Pisot theta0 sequence.at n=36A097600
• Number of -n..n arrays x(0..4) of 5 elements with zero sum and no element more than one greater than the previous.at n=18A199849
• Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise coprime.at n=39A201218
• n*(n^2-2*n-1).at n=27A214446
• Number of integer partitions of 2n with exactly n distinct sums of nonempty submultisets.at n=38A365660
• Irregular triangular array read by rows. T(n,k) is the number of simple labeled graphs on [n] with circuit rank equal to k, n >= 1, 0 <= k <= binomial(n-1,2).at n=36A372153
• Integers k equal to the sum over A024816(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation.at n=24A377002
• Number for rooted ordered trees with edge weights summing to n, where edge weights are all greater than zero, and the sequences of edge weights in all downward paths are weakly increasing.at n=9A384937