|
| |
|
|
A140649
|
|
Triangle whose rows are decreasing powers of 2, followed by 0.
|
|
0
| |
|
|
1, 0, 2, 1, 0, 4, 2, 1, 0, 8, 4, 2, 1, 0, 16, 8, 4, 2, 1, 0, 32, 16, 8, 4, 2, 1, 0, 64, 32, 16, 8, 4, 2, 1, 0, 128, 64, 32, 16, 8, 4, 2, 1, 0, 256, 128, 64, 32, 16, 8, 4, 2, 1, 0, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1, 0, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1, 0, 2048, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1, 0, 4096
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,3
|
|
|
FORMULA
| T(n,k) = 2^(n-k-1) if n>k, otherwise 0.
|
|
|
EXAMPLE
| Triangle begins
1, 0,
2, 1, 0,
4, 2, 1, 0,
8, 4, 2, 1, 0,
16, 8, 4, 2, 1, 0,
32, 16, 8, 4, 2, 1, 0,
64, 32, 16, 8, 4, 2, 1, 0
|
|
|
PROG
| (PARI) T(n, k) = if(n>k, 2^(n-k-1), 0);
for(n=2, 10, for(k=1, n, print1(T(n, k), ", ")); print()); /* show triangle */
|
|
|
CROSSREFS
| Sequence in context: A139136 A138002 A062296 * A091453 A062173 A004558
Adjacent sequences: A140646 A140647 A140648 * A140650 A140651 A140652
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Jul 09 2008
|
| |
|
|
