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 A182886 #10 Nov 04 2019 02:24:57
%S A182886 1,0,1,0,1,1,2,0,2,1,0,6,1,3,1,0,6,12,3,4,1,6,0,24,21,6,5,1,0,30,12,
%T A182886 60,34,10,6,1,0,30,90,60,121,52,15,7,1,20,0,180,215,76,21,8,1,0,140,
%U A182886 90,630,540,421,351,107,28,9,1,0,140,560,630,1710,1176,846,539,146,36,10,1
%N A182886 Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps. These are paths that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: a (1,0)-step with weight 1; a (1,0)-step with weight 2; a (1,1)-step with weight 2; a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.
%C A182886 Sum of entries in row n is A051286(n).
%C A182886 T(3n,0) = binomial(2n,n) = A000984(n).
%C A182886 T(n,0) = 0 if n mod 3 > 0.
%C A182886 Sum_{k=0..n} k*T(n,k) = A182887(n).
%H A182886 M. Bona and A. Knopfmacher, <a href="https://doi.org/10.1007/s00026-010-0060-7">On the probability that certain compositions have the same number of parts</a>, Ann. Comb., 14 (2010), 291-306.
%H A182886 E. Munarini, N. Zagaglia Salvi, <a href="https://doi.org/10.1016/S0012-365X(02)00378-3">On the Rank Polynomial of the Lattice of Order Ideals of Fences and Crowns</a>, Discrete Mathematics 259 (2002), 163-177.
%F A182886 G.f.: G(t,z) = 1/sqrt(1 - 2tz - 2tz^2 + t^2*z^2 + 2t^2*z^3 + t^2*z^4 - 4z^3).
%e A182886 T(3,2)=2. Indeed, denoting by h (H) the (1,0)-step of weight 1 (2), and u=(1,1), d=(1,-1), the five paths of weight 3 are ud, du, hH, Hh, and hhh; two of them, namely hH and Hh, have exactly two (1,0)-steps.
%e A182886 Triangle starts:
%e A182886 1;
%e A182886 0, 1;
%e A182886 0, 1, 1;
%e A182886 2, 0, 2, 1;
%e A182886 0, 6, 1, 3, 1;
%e A182886 0, 6, 12, 3, 4, 1;
%p A182886 G:=1/sqrt(1-2*t*z-2*t*z^2+t^2*z^2+2*t^2*z^3+t^2*z^4-4*z^3): Gser:=simplify(series(G,z=0,14)): for n from 0 to 11 do P[n]:=sort(coeff(Gser,z,n)) od: for n from 0 to 11 do seq(coeff(P[n],t,k),k=0..n) od; # yields sequence in triangular form
%Y A182886 Cf. A051286, A182887, A000984.
%K A182886 nonn,tabl
%O A182886 0,7
%A A182886 _Emeric Deutsch_, Dec 11 2010