login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166692 Triangle T(n,k) read by rows: T(n,k) = 2^(k-1), k>0. T(n,0) = (n+1) mod 2. 2
1, 0, 1, 1, 1, 2, 0, 1, 2, 4, 1, 1, 2, 4, 8, 0, 1, 2, 4, 8, 16 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

Variant of A166918.

FORMULA

T(2n,k) = A011782(k). T(2n+1,k) = A131577(k).

sum_{k=0..n} T(n,k) = A051049(n).

EXAMPLE

1;

0,1;

1,1,2;

0,1,2,4;

1,1,2,4,8;

0,1,2,4,8,16;

CROSSREFS

Cf. A166494.

Sequence in context: A117316 A109189 A144172 * A046766 A003285 A059347

Adjacent sequences:  A166689 A166690 A166691 * A166693 A166694 A166695

KEYWORD

nonn,easy,tabl

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Oct 18 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:49 EST 2012. Contains 205893 sequences.