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

Offset

1,2

Comments

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

Links

Table of n, a(n) for n=1..5.

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

Higher Dimensions Number of simple paths in a tesseract [From Dmitry Kamenetsky, Aug 28 2009]

Example

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

Crossrefs

Cf. A007764.

Cf. A091299, A006069, A006070, A003042, A066037, A091302.

Sequence in context: A055687 A006262 A003043 * A309972 A208056 A276092

Adjacent sequences: A059780 A059781 A059782 * A059784 A059785 A059786

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