|
| |
|
|
A140946
|
|
Triangle T(n,k) = (-2)^n*(-1)^k if k<n; T(n,n) = (-1)^(n+1)*A001045(n+1).
|
|
0
| |
|
|
1, -2, -1, 4, -4, 3, -8, 8, -8, -5, 16, -16, 16, -16, 11, -32, 32, -32, 32, -32, -21, 64, -64, 64, -64, 64, -64, 43, -128, 128, -128, 128, -128, 128, -128, -85, 256, -256, 256, -256, 256, -256, 256, -256, 171, -512, 512, -512, 512, -512, 512, -512, 512, -512, -341, 1024, -1024, 1024, -1024, 1024
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| The sequence appears if the values b(n+1)-2*b(n) are computed from the (flattened) sequence b(.)=A140944.
Reading the triangle by rows, taking absolute values and removing duplicates we obtain A112387.
|
|
|
FORMULA
| T(n,k) = A140944(n,k+1)-2*A140944(n,k), k<n.
T(n,n) = A140944(n+1,0) -2*A140944(n,n).
|
|
|
EXAMPLE
| 1;
-2,-1;
4,-4,3;
-8,8,-8,-5;
16,-16,16,-16,11;
-32,32,-32,32,-32,-21;
64,-64,64,-64,64,-64,43;
-128,128,-128,128,-128,128,-128,-85;
|
|
|
CROSSREFS
| Cf. A140513, A140589.
Sequence in context: A101621 A086484 A091335 * A008741 A110316 A111975
Adjacent sequences: A140943 A140944 A140945 * A140947 A140948 A140949
|
|
|
KEYWORD
| sign,tabl
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Jul 24 2008
|
|
|
EXTENSIONS
| Edited by R. J. Mathar, Jul 06 2011
|
| |
|
|
