login
A166918
Triangle T(n,k) read by rows: T(n,0) = n mod 2. T(n,k) = 2^(k-1), 0<k<=n.
1
0, 1, 1, 0, 1, 2, 1, 1, 2, 4, 0, 1, 2, 4, 8, 1, 1, 2, 4, 8, 16, 0, 1, 2, 4, 8, 16, 32, 1, 1, 2, 4, 8, 16, 32, 64, 0, 1, 2, 4, 8, 16, 32, 64, 128, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024
OFFSET
0,6
FORMULA
T(2n,k) = A131577(k). T(2n+1,k) = A011782(k).
sum_{k=0..n} T(n,k) = A166920(n).
EXAMPLE
0;
1,1;
0,1,2;
1,1,2,4;
0,1,2,4,8;
1,1,2,4,8,16;
0,1,2,4,8,16,32;
1,1,2,4,8,16,32,64;
MATHEMATICA
t[n_, 0] := Mod[n, 2]; t[n_, k_] := 2^(k - 1); Table[ t[n, k], {n, 0, 11}, {k, 0, n}] // Flatten
CROSSREFS
Sequence in context: A077971 A030018 A010739 * A143576 A297159 A293438
KEYWORD
nonn,tabl,easy
AUTHOR
Paul Curtz, Oct 23 2009
STATUS
approved