47518

Appears in sequences

• a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A000984(k) = C(2*k,k) equals n.at n=36A081393
• Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=8A207027
• Number of triangular nXnXn arrays of occupancy after each element either stays or moves to some neighbor and with no occupancy greater than 6.at n=3A217508
• T(n,k) is the number of triangular n X n X n arrays of occupancy after each element either stays or moves to some neighbor and with no occupancy greater than k.at n=39A217510
• a(n) = a(n-1) + a(n-2) + 2 a([(n-1)/2]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=19A298355