|
Search: id:A059783
|
|
|
| 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
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Starting with n=3 there are also paths that change from the value 1 to the 0 like : 000,100,110,010,011,111.
|
|
EXAMPLE
|
a(2) = 2 because there are 2 paths: 00,01,11 and 00,10,11
|
|
CROSSREFS
|
Sequence in context: A055687 A006262 A003043 this_sequence A066361 A120929 A007184
Adjacent sequences: A059780 A059781 A059782 this_sequence A059784 A059785 A059786
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Avi Peretz (njk(AT)netvision.net.il), Feb 22 2001
|
|
|
Search completed in 0.002 seconds
|
