|
| |
|
|
A129952
|
|
Binomial transform of A124625.
|
|
8
| |
|
|
1, 1, 2, 6, 16, 40, 96, 224, 512, 1152, 2560, 5632, 12288, 26624, 57344, 122880, 262144, 557056, 1179648, 2490368, 5242880, 11010048, 23068672, 48234496, 100663296, 209715200, 436207616, 905969664, 1879048192, 3892314112
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Essentially the same as A057711: a(n) = A057711(n-1) for n > 1.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index to sequences with linear recurrences with constant coefficients, signature (4,-4).
|
|
|
FORMULA
| a(0) = 1, a(1) = 1; for n > 1, a(n) = n*2^(n-2).
G.f.: (1-3*x+2*x^2+2*x^3)/(1-2*x)^2.
|
|
|
PROG
| (MAGMA) m:=15; S:=&cat[ [ 1, 2*i ]: i in [0..m] ]; [ &+[ Binomial(j-1, k-1)*S[k]: k in [1..j] ]: j in [1..2*m] ]; /* Klaus Brockhaus, Jun 17 2007 */
(PARI) {m=29; print1(1, ", ", 1, ", "); for(n=2, m, print1(n*2^(n-2), ", "))} /* Klaus Brockhaus, Jun 17 2007 */
|
|
|
CROSSREFS
| Cf. A124625, A045623, A057711, A129953 (first differnces), A129954 (second differnces), A129955 (third differnces).
Sequence in context: A198951 A078774 A174016 * A057711 A111281 A018021
Adjacent sequences: A129949 A129950 A129951 * A129953 A129954 A129955
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Jun 10 2007
|
|
|
EXTENSIONS
| Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 17 2007
|
| |
|
|
