|
Search: id:A036442
|
|
|
| A036442 |
|
a(n) = 2^((n-1)*(n+2)/2) |
|
+0
7
|
|
| 1, 4, 32, 512, 16384, 1048576, 134217728, 34359738368, 17592186044416, 18014398509481984, 36893488147419103232, 151115727451828646838272, 1237940039285380274899124224
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Number of redundant paths for a fault-tolerant ATM switch.
Hankel transform (see A001906 for definition ) of A001850, A006139, A084601; also Hankel transform of the sequence 1, 0, 4, 0, 24, 0, 160, 0, 1120, ... (A059304 with interpolated zeros) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 03 2005
|
|
REFERENCES
|
C. Lo and C. Chiu, "A Fault-Tolerant Architecture for ATM Networks," 20th IEEE Conf. Local Computer Networks, 1995, pp. 29-36
|
|
LINKS
|
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
|
|
CROSSREFS
|
Sequence in context: A093581 A102557 A118990 this_sequence A127945 A086899 A012509
Adjacent sequences: A036439 A036440 A036441 this_sequence A036443 A036444 A036445
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Abdallah Rayhan (rayhan(AT)engr.uvic.ca)
|
|
|
Search completed in 0.002 seconds
|
