Number of paths (without loops) in graph of n-dimensional hypercube starting at point (0,0,0,...,0) and ending at (1,1,1,...,1).
A059783
Number of paths (without loops) in graph of n-dimensional hypercube starting at point (0,0,0,...,0) and ending at (1,1,1,...,1).
Terms
- a(0) =1a(1) =2a(2) =18a(3) =6432a(4) =18651552840
External references
- oeis: A059783