|
Search: id:A131068
|
|
|
| A131068 |
|
Binomial transform of [1, 1, 7, 7, 7,...]. |
|
+0
2
|
|
| 1, 2, 10, 32, 82, 188, 406, 848, 1738, 3524, 7102, 14264, 28594, 57260, 114598, 229280, 458650, 917396, 1834894, 3669896, 7339906, 14679932, 29359990, 58720112, 117440362, 234880868, 469761886, 939523928, 1879048018, 3758096204
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Row sums of triangle A131067. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
FORMULA
|
a(n)=7*2^n-6*n-6. G.f.=(1-2x+7x^2)/[(1-2x)(1-x)^2]. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
EXAMPLE
|
a(3) = 32 = sum of row 4 terms of triangle A131067: (1 + 15 + 15 + 1).
a(3) = 32 = (1, 3, 3, 1) dot (1, 1, 7, 7) = (1 + 3 + 21 + 7).
|
|
MAPLE
|
a := proc (n) options operator, arrow; 7*2^n-6*n-6 end proc: seq(a(n), n = 0 .. 30); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
MATHEMATICA
|
s=1; lst={s}; Do[s+=s+=n; AppendTo[lst, s], {n, 0, 5!, 3}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 10 2008]
|
|
CROSSREFS
|
Cf. A131060, A131061, A131062, A131063, A131064, A131065, A131066, A131067.
Sequence in context: A050927 A011921 A103290 this_sequence A034555 A084154 A083099
Adjacent sequences: A131065 A131066 A131067 this_sequence A131069 A131070 A131071
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 13 2007
|
|
EXTENSIONS
|
Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
|
Search completed in 0.002 seconds
|
