162498

Appears in sequences

• Number of n-length words on {0,1,2,3} avoiding runs of zeros of length 1 (mod 3).at n=10A255631
• G.f. = b(2)^2*b(4)/(2*x^5+x^4-2*x^3-x^2-x+1), where b(k) = (1-x^k)/(1-x).at n=18A266370
• Total number of nodes summed over all lattice paths from (0,0) to (n,n) that consist of steps (h,v) with h, v prime or one.at n=10A308241