111104

Appears in sequences

• Number of nX1 0..2 arrays with exactly floor(nX1/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.at n=13A222884
• Number of nX2 0..2 arrays with exactly floor(nX2/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=6A223098
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=34A223104
• Number of 7Xn 0..2 arrays with exactly floor(7Xn/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=1A223110
• Triangle read by rows: T(n,k), 1 <= k <= n, is the number of non-degenerate fanout-free Boolean functions of n variables having AND rank k.at n=33A225171
• Number of length 3+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=9A248464
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood.at n=16A281417
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 433", based on the 5-celled von Neumann neighborhood.at n=16A288202
• Number of integer partitions of n where some part is the difference of two consecutive parts.at n=47A364467
• a(n) = n+1 for n = 1 to 8; a(n) = 100 + a(n-8) for n = 9 to 16; thereafter a(8*i+j) = 10^(i+1) + a(8*(i-1)+j) for i >= 2, 1 <= j <= 8.at n=34A367342