cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A166918 Triangle T(n,k) read by rows: T(n,0) = n mod 2. T(n,k) = 2^(k-1), 0

This page as a plain text file.
%I A166918 #7 Mar 30 2012 18:52:04
%S A166918 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,
%T A166918 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,
%U A166918 16,32,64,128,256,512,1,1,2,4,8,16,32,64,128,256,512,1024
%N A166918 Triangle T(n,k) read by rows: T(n,0) = n mod 2. T(n,k) = 2^(k-1), 0<k<=n.
%F A166918 T(2n,k) = A131577(k). T(2n+1,k) = A011782(k).
%F A166918 sum_{k=0..n} T(n,k) = A166920(n).
%e A166918 0;
%e A166918 1,1;
%e A166918 0,1,2;
%e A166918 1,1,2,4;
%e A166918 0,1,2,4,8;
%e A166918 1,1,2,4,8,16;
%e A166918 0,1,2,4,8,16,32;
%e A166918 1,1,2,4,8,16,32,64;
%t A166918  t[n_, 0] := Mod[n, 2]; t[n_, k_] := 2^(k - 1); Table[ t[n, k], {n, 0, 11}, {k, 0, n}] // Flatten
%Y A166918 Cf. A166692, A059268.
%K A166918 nonn,tabl,easy
%O A166918 0,6
%A A166918 _Paul Curtz_, Oct 23 2009