51568

Appears in sequences

• Trajectory of 3 under map n->13n+1 if n odd, n->n/2 if n even.at n=33A037104
• Number of 6-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions.at n=18A187176
• Number of length 3+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=10A249659
• Number of nX5 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A279265
• Number of nX6 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=4A279266
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=49A279268
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=50A279268
• The number of unlabeled trees T on n vertices for which maximum multiplicity attained by any matrix whose graph is T implies the simplicity of its other eigenvalues.at n=21A347018