|
|
A058922
|
|
a(n) = n*2^n - 2^n.
|
|
9
|
|
|
0, 4, 16, 48, 128, 320, 768, 1792, 4096, 9216, 20480, 45056, 98304, 212992, 458752, 983040, 2097152, 4456448, 9437184, 19922944, 41943040, 88080384, 184549376, 385875968, 805306368, 1677721600, 3489660928, 7247757312
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A hierarchical sequence (S(W'2{2}*c) - see A059126).
a(n) = -det(M(n+1)) where M(n) is the n X n matrix with m(i,i)=1, m(i,j)=-i/j for i != j. - Benoit Cloitre, Feb 01 2003
|
|
LINKS
|
|
|
FORMULA
|
With offset 0, this is 4n*2^(n-1), the binomial transform of 4n. - Paul Barry, May 20 2003
a(n)= 4*a(n-1) - 4*a(n-2).
G.f.: 4*x^2/(2*x-1)^2. (End)
Sum_{n>=2} 1/a(n) = log(2)/2.
Sum_{n>=2} (-1)^n/a(n) = log(3/2)/2. (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) { for (n = 1, 200, write("b058922.txt", n, " ", n*2^n - 2^n); ) } \\ Harry J. Smith, Jun 24 2009
(Haskell)
a058922 n = (n - 1) * 2 ^ n
a058922_list = zipWith (*) [0..] $ tail a000079_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|