1443616
domain: N
Appears in sequences
- Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 3.at n=4A000768
- a(n) = (1/2) * Sum_{k=1..n} (-1)^(k-1) * binomial(2*n-k, k) * binomial(n, k) * 2^k * (2*n-2*k)!.at n=4A159960
- Triangle read by rows: Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = k.at n=31A227511