|
Search: id:A086828
|
|
|
| A086828 |
|
a(1) = 0, a(2) = 1, a(3) = 1, a(4) = 7; thereafter, a(n) = a(n-1) + (n-1)*a(n-2). |
|
+0
1
|
|
| 0, 1, 1, 7, 11, 46, 112, 434, 1330, 5236, 18536, 76132, 298564, 1288280, 5468176, 24792376, 112283192, 533753584, 2554851040, 12696169136, 63793189936, 330412741792, 1733862920384, 9333355981600, 50946066070816
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Number of networks with bandwidth n.
|
|
REFERENCES
|
P. C. Gilmore et al., Well-solved special cases, pp. 87-143 of E. L. Lawler et al., eds., The Traveling Salesman Problem, Wiley, 1985.
|
|
CROSSREFS
|
Sequence in context: A129865 A153377 A062209 this_sequence A117392 A105867 A166653
Adjacent sequences: A086825 A086826 A086827 this_sequence A086829 A086830 A086831
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Aug 08 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Apr 01 2005
|
|
|
Search completed in 0.002 seconds
|
