76956
domain: N
Appears in sequences
- Number of Hamiltonian paths in the graph on n vertices {1,...,n}, with i adjacent to j iff |i-j| <= 2.at n=27A069241
- G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^5)^2.at n=8A213095
- Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance 2w apart where the walk starts at the middle point between the planes.at n=23A338125