68088
domain: N
Appears in sequences
- a(n) = T(3,n), array T given by A048505.at n=10A048508
- 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=20A187176
- Number of nX1 0..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=13A209173
- Cyclops numbers with circular digits {0,6,8,9}.at n=23A274765
- Numbers k such that 7*10^k - 89 is prime.at n=25A281828
- Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h X 2h X 2h where the walk starts at the center of the box.at n=38A337023