|
| |
| |
|
|
|
0, 2, 16, 72, 256, 800, 2304, 6272, 16384, 41472, 102400, 247808, 589824, 1384448, 3211264, 7372800, 16777216, 37879808, 84934656, 189267968, 419430400, 924844032, 2030043136, 4437573632, 9663676416, 20971520000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| "The traveling salesman problem can be solved in time O(n^2 2^n) (where n is the size of the network to visit)." [Wikipedia] - Jonathan Vos Post (jvospost3(AT)gmail.com), Apr 10 2006
|
|
|
REFERENCES
| Konrad Knopp, Theory and Application of Infinite Series, Dover, p. 269.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for sequences related to linear recurrences with constant coefficients, signature (6,-12,8).
Konrad Knopp, Theorie und Anwendung der unendlichen Reihen, Berlin, J. Springer, 1922. (Original german edition of "Theory and Application of Infinite Series")
Wikipedia, Complexity.
|
|
|
FORMULA
| a(n) = 2*A014477(n-1). G.f.: 2x(1+2x)/(1-2x)^3. Binomial transform of A002939. Inverse binomial transform of A062189. - Henry Bottomley (se16(AT)btinternet.com), Jun 13 2001
Sum(n=1, inf, 1/a(n))=Pi^2/12-1/2*(ln(2))^2. - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 05 2002
a(n)=sum(k*2^k, k=1..n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 09 2006
|
|
|
MAPLE
| seq(seq(k^n*n^k, k=2..2), n=0..25); and seq(2^n*n^2, n=0..25); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 01 2007
|
|
|
MATHEMATICA
| f[n_]:=n^2*2^n; Table[f[n], {n, 0, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 05 2009]
|
|
|
PROG
| (MAGMA) [2^n*n^2: n in [0..30]]; // Vincenzo Librandi, Oct 27 2911
|
|
|
CROSSREFS
| Sequence in context: A006733 A034580 A006729 * A034581 A028336 A197992
Adjacent sequences: A007755 A007756 A007757 * A007759 A007760 A007761
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| David J. Snook (ua532(AT)freenet.victoria.bc.ca)
|
| |
|
|
