155756
domain: N
Appears in sequences
- 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 w apart where the walk starts on one of the planes.at n=30A338126
- Number of (undirected) Hamiltonian paths on the first n cells of the 3 X ceiling(n/3) knight graph.at n=37A389759
- Number of permutations f of {1,...,n} with f(1) = 1 such that k*f(k) (k = 1..n) are distinct practical numbers.at n=15A389880