45152

Appears in sequences

• Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=34A078612
• Expansion of (1+2*x)/((1+x)*(1-x^2-x^3)).at n=40A098601
• Number of ways to place 3 nonattacking wazirs on a 3 X n board.at n=22A172229
• T(n,k) is the number of n-step one or two collinear space at a time queen's tours on a k X k board summed over all starting positions.at n=32A187027
• Number of 5-step one or two collinear space at a time queen's tours on an n X n board summed over all starting positions.at n=3A187030
• p-INVERT of (0,1,0,1,0,1,...), where p(S) = (1 - S)^2 (1 - 2 S).at n=10A291238