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.
%I A074079 #5 May 01 2014 02:48:25 %S A074079 1,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,0,2,1,0,0, %T A074079 0,0,0,0,3,2,0,0,0,0,0,0,1,3,5,1,0,0,0,0,0,0,1,3,10,3,0,0,0,0,0,0,0,0, %U A074079 3,17,9,1,0,0,0,0,0,0,0,1,5,28,24,4,0,0,0,0,0,0,0,0,0,4,41,57,14,1,0,0,0 %N A074079 Square array A(row,col) (listed in order A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), A(0,3), etc.), giving essentially the same information as the triangle A074080 which shows only the upper triangular region. %F A074079 A074079(n, k) = A073346(n, k)/(2^k) %p A074079 A074079bi := (n,k) -> A073346bi(n,k)/(2^k); %p A074079 A074079 := n -> A074079bi(A025581(n), A002262(n)); %p A074079 A025581 := n -> binomial(1+floor((1/2)+sqrt(2*(1+n))),2) - (n+1); %p A074079 A002262 := n -> n - binomial(floor((1/2)+sqrt(2*(1+n))),2); %Y A074079 Obtained from the square array A073346 by dividing the entries on the k-th row by 2^k. Column sums: A073431. See A074080 for explanation. Cf. also A025581, A002262. %K A074079 nonn,tabl %O A074079 0,31 %A A074079 _Antti Karttunen_, Aug 19 2002