922368
domain: N
Appears in sequences
- Number of 3-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=31A187164
- a(n) = Sum_{k=0..n} binomial(n, 2k)*binomial(n-k, k)*(-1)^k.at n=16A278415
- a(n)/n! is the average number of key comparisons required to sort n records with distinct keys using a modified heapsort (Algorithm H in Don Knuth's TAOCP Vol. 3, answer to exercise 18).at n=6A350569