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 A167763 #22 Feb 18 2021 00:29:15
%S A167763 1,1,0,1,1,0,1,2,1,0,1,3,3,1,0,1,4,7,4,1,0,1,5,12,12,5,1,0,1,6,18,30,
%T A167763 18,6,1,0,1,7,25,55,55,25,7,1,0,1,8,33,88,143,88,33,8,1,0,1,9,42,130,
%U A167763 273,273,130,42,9,1,0,1,10,52,182,455,728,455,182,52,10,1,0
%N A167763 Pendular triangle (p=0), read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), otherwise T(n,k) = T(n,n-1-k) + p*T(n-1,k), for n >= k <= 0, with T(n,0) = 1 and T(n,n) = 0^n.
%C A167763 See A118340 for definition of pendular triangles and pendular sums.
%C A167763 The last five rows in the example section appear in the table on p. 8 of Getzler. Cf. also A173075. - _Tom Copeland_, Jan 22 2020
%H A167763 G. C. Greubel, <a href="/A167763/b167763.txt">Rows n = 0..100 of the triangle, flattened</a>
%H A167763 E. Getzler, <a href="http://arxiv.org/abs/alg-geom/9612005">The semi-classical approximation for modular operads</a>, arXiv:alg-geom/9612005, 1996.
%F A167763 T(2n+m) = [A001764^(m+1)](n), i.e., the m-th lower semi-diagonal forms the self-convolution (m+1)-power of A001764.
%F A167763 If n > 2k, T(n,k) = binomial(n+k+1,k)*(n-2k+1)/(n+k+1), else T(n,k) = T(n,n-1-k), with conditions: T(n,0)=1 for n>=0 and T(n,n)=0 for n > 0. - _Paul D. Hanna_, Nov 12 2009
%F A167763 Sum_{k=0..n} T(n, k, p=0) = A093951(n). - _G. C. Greubel_, Feb 17 2021
%e A167763 Triangle begins:
%e A167763 1;
%e A167763 1, 0;
%e A167763 1, 1, 0;
%e A167763 1, 2, 1, 0;
%e A167763 1, 3, 3, 1, 0;
%e A167763 1, 4, 7, 4, 1, 0;
%e A167763 1, 5, 12, 12, 5, 1, 0; ...
%t A167763 T[n_, k_, p_]:= T[n,k,p] = If[n<k || k<0, 0, If[k==0, 1, If[k==n, 0, If[n<=2*k, T[n,n-k-1,p] + p*T[n-1,k,p], T[n,n-k,p] + T[n-1,k,p] ]]]];
%t A167763 Table[T[n,k,0], {n,0,12}, {k,0,n}]//Flatten (* _G. C. Greubel_, Feb 17 2021 *)
%o A167763 (PARI) {T(n,k)=if(k==0,1,if(n==k,0,if(n>2*k,binomial(n+k+1,k)*(n-2*k+1)/(n+k+1),T(n,n-1-k))))} \\ _Paul D. Hanna_, Nov 12 2009
%o A167763 (Sage)
%o A167763 @CachedFunction
%o A167763 def T(n, k, p):
%o A167763 if (k<0 or n<k): return 0
%o A167763 elif (k==0): return 1
%o A167763 elif (k==n): return 0
%o A167763 elif (n>2*k): return T(n,n-k,p) + T(n-1,k,p)
%o A167763 else: return T(n, n-k-1, p) + p*T(n-1, k, p)
%o A167763 flatten([[T(n, k, 0) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, Feb 17 2021
%o A167763 (Magma)
%o A167763 function T(n,k,p)
%o A167763 if k lt 0 or n lt k then return 0;
%o A167763 elif k eq 0 then return 1;
%o A167763 elif k eq n then return 0;
%o A167763 elif n gt 2*k then return T(n,n-k,p) + T(n-1,k,p);
%o A167763 else return T(n,n-k-1,p) + p*T(n-1,k,p);
%o A167763 end if;
%o A167763 return T;
%o A167763 end function;
%o A167763 [T(n,k,0): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Feb 17 2021
%Y A167763 Cf. this sequence (p=0), A118340 (p=1), A118345 (p=2), A118350 (p=3).
%Y A167763 Cf. A001764, A006013, A006629, A093951, A102893, A173075.
%K A167763 nonn,tabl
%O A167763 0,8
%A A167763 _Philippe Deléham_, Nov 11 2009