65326

Appears in sequences

• Number of (n+1)X(3+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order.at n=6A231339
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order.at n=38A231343
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order.at n=42A231343
• Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by more than one.at n=14A269584
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=15A287509
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood.at n=15A288192
• Difference between 4^n and the product of primes less than or equal to n.at n=8A319857
• a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).at n=42A353150
• G.f. satisfies A(x) = (1 + x^4) * (1 + x*A(x)^2).at n=11A364330