22672

Appears in sequences

• Array read by antidiagonals: T(n,k) is the number of n-step king's tours on a k X k board summed over all starting positions.at n=41A186861
• Number of 6-step king's tours on an n X n board summed over all starting positions.at n=3A186865
• Number of 7-step self-avoiding walks on an n X n square summed over all starting positions.at n=7A188152
• Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.at n=5A197472
• Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.at n=4A197473
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.at n=49A197475
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.at n=50A197475
• Number n such that a2 - n^3 is a triangular number (A000217), where a2 is the least square above n^3.at n=37A233400
• Number of compositions of n with c(1) = 1, c(i+1) - c(i) <= 1, and c(i+1) - c(i) != 0.at n=38A238870
• a(n) = round(3F2([1, 3/2, 1 - n], [2, 2], -4)).at n=9A246657
• Numbers k such that s(k) = s(k+1), where s(k) is A059975.at n=14A327250
• Least multiple of n that contains only the distinct digits of n and n+1, with each of those digits appearing at least once.at n=25A328326
• a(n) is the number of vertices formed by n-secting the angles of a nonagon (enneagon).at n=37A335782
• Number of generalized polyforms on the trihexagonal tiling with n cells.at n=10A343398
• a(n) = (A051894(n) - 1)/2.at n=18A361152