|
| |
|
|
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).
|
|
0
| | |
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Starting with n=3 there are also paths that change from the value 1 to the 0 like : 000,100,110,010,011,111.
|
|
|
LINKS
| Higher Dimensions forum [From Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Aug 28 2009]
|
|
|
EXAMPLE
| a(2) = 2 because there are 2 paths: 00,01,11 and 00,10,11
|
|
|
CROSSREFS
| Sequence in context: A055687 A006262 A003043 * A191554 A066361 A120929
Adjacent sequences: A059780 A059781 A059782 * A059784 A059785 A059786
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Avi Peretz (njk(AT)netvision.net.il), Feb 22 2001
|
|
|
EXTENSIONS
| Added a(4), based on http://teamikaria.com/4dforum/viewtopic.php?f=5&t=1211 Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Aug 28 2009
|
| |
|
|
