109386
domain: N
Appears in sequences
- Number of ways writing 2^n as a sum of two nonprime numbers.at n=17A062306
- Triangle read by rows: T(n, k) = Sum_{j=0..k} (-1)^j*binomial(n, j)*(k + 1 - j)^(n - 1).at n=42A162498
- Number of n-length words w over 4-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=11A213292
- Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A238058
- Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A238061
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=6A238063
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=9A238063