A059783 - OEIS

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).

1, 2, 18, 6432, 18651552840

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Terms up to a(5)=18651552840 confirmed by independent computation. [Joerg Arndt, Aug 07 2012]

LINKS

J. Berestycki, É. Brunet, and Z. Shi, Accessibility percolation with backsteps, arXiv preprint arXiv:1401.6894 [math.PR], 2014.

EXAMPLE

a(2) = 2 because there are 2 paths: 00,01,11 and 00,10,11

CROSSREFS

KEYWORD

nonn,hard,more

AUTHOR

Avi Peretz (njk(AT)netvision.net.il), Feb 22 2001

EXTENSIONS

Added a(5), based on http://teamikaria.com/4dforum/viewtopic.php?f=5&t=1211 Dmitry Kamenetsky, Aug 28 2009

Corrected offset Alex Ratushnyak, Aug 07 2012

STATUS

approved