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 A136482 #5 Sep 21 2015 01:27:57
%S A136482 1,1,1,1,3,1,1,4,4,1,1,6,8,6,1,1,7,14,14,7,1,1,9,21,30,21,9,1,1,10,30,
%T A136482 51,51,30,10,1,1,12,40,84,102,84,40,12,1,1,13,52,124,186,186,124,52,
%U A136482 13,1,1,15,65,180,310,378,310,180,65,15,1,1,16,80,245,490,688,688,490,245
%N A136482 Triangle read by rows: T(n,k) = 2*A007318(n,k) - A034851(n,k) (i.e., twice Pascal's triangle - the Losanitch triangle).
%C A136482 Row sums are apparently in A135098. - _R. J. Mathar_, May 01 2008
%e A136482 Row n=3 is 2*(1,3,3,1) - (1,2,2,1) = (1,4,4,1).
%p A136482 A007318 := proc(n,k) binomial(n,k) ; end: A051159 := proc(n,k) binomial(n mod 2, k mod 2)*binomial(floor(n/2),floor(k/2)) ; end: A034851 := proc(n,k) (A007318(n,k)+A051159(n,k))/2 ; end: A136482 := proc(n,k) 2*A007318(n,k)-A034851(n,k) ; end: for n from 0 to 13 do for k from 0 to n do printf("%d,",A136482(n,k)) ; od: od: # _R. J. Mathar_, May 01 2008
%Y A136482 Cf. A007318, A034851, A136489.
%K A136482 nonn,tabl
%O A136482 0,5
%A A136482 _Gary W. Adamson_, Dec 31 2007
%E A136482 Edited and corrected by _R. J. Mathar_, May 01 2008