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 A026758 #16 Oct 30 2019 01:12:07
%S A026758 1,1,1,1,2,1,1,4,3,1,1,5,7,4,1,1,7,16,11,5,1,1,8,23,27,16,6,1,1,10,38,
%T A026758 66,43,22,7,1,1,11,48,104,109,65,29,8,1,1,13,69,190,279,174,94,37,9,1,
%U A026758 1,14,82,259,469,453,268,131,46,10,1,1,16,109,410,918,1201,721,399,177,56,11,1
%N A026758 Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is odd and 1 <= k <= (n-1)/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).
%H A026758 G. C. Greubel, <a href="/A026758/b026758.txt">Rows n = 0..100 of triangle, flattened</a>
%F A026758 T(n, k) = number of paths from (0, 0) to (n-k, k) in directed graph having vertices (i, j) and edges (i, j)-to-(i+1, j) and (i, j)-to-(i, j+1) for i, j >= 0 and edges (i, 2h+i+1)-to-(i+1, 2h+i+2) for i >= 0, h>=0.
%e A026758 Triangle begins as:
%e A026758 1;
%e A026758 1, 1;
%e A026758 1, 2, 1;
%e A026758 1, 4, 3, 1;
%e A026758 1, 5, 7, 4, 1;
%e A026758 1, 7, 16, 11, 5, 1;
%e A026758 1, 8, 23, 27, 16, 6, 1;
%e A026758 1, 10, 38, 66, 43, 22, 7, 1;
%p A026758 T:= proc(n,k) option remember;
%p A026758 if k=0 or k = n then 1;
%p A026758 elif type(n,'odd') and k <= (n-1)/2 then
%p A026758 procname(n-1,k-1)+procname(n-2,k-1)+procname(n-1,k) ;
%p A026758 else
%p A026758 procname(n-1,k-1)+procname(n-1,k) ;
%p A026758 end if ;
%p A026758 end proc;
%p A026758 seq(seq(T(n,k), k=0..n), n=0..12); # _G. C. Greubel_, Oct 29 2019
%t A026758 T[n_, k_]:= T[n, k]= If[k==0 || k==n, 1, If[OddQ[n] && k<=(n-1)/2, T[n-1, k-1] + T[n-2, k-1] + T[n-1, k], T[n-1, k-1] + T[n-1, k] ]]; Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* _G. C. Greubel_, Oct 29 2019 *)
%o A026758 (PARI) T(n,k) = if(k==0 || k==n, 1, if(n%2==1 && k<=(n-1)/2, T(n-1,k-1) + T(n-2,k-1) + T(n-1,k), T(n-1,k-1) + T(n-1,k) ));
%o A026758 for(n=0,12, for(k=0,n, print1(T(n,k), ", "))) \\ _G. C. Greubel_, Oct 29 2019
%o A026758 (Sage)
%o A026758 @CachedFunction
%o A026758 def T(n, k):
%o A026758 if (k==0 or k==n): return 1
%o A026758 elif (mod(n,2)==1 and k<=(n-1)/2): return T(n-1,k-1) + T(n-2,k-1) + T(n-1,k)
%o A026758 else: return T(n-1,k-1) + T(n-1,k)
%o A026758 [[T(n, k) for k in (0..n)] for n in (0..12)] # _G. C. Greubel_, Oct 29 2019
%o A026758 (GAP)
%o A026758 T:= function(n,k)
%o A026758 if k=0 or k=n then return 1;
%o A026758 elif (n mod 2)=1 and k<Int(n/2)+1 then return T(n-1,k-1)+T(n-2,k-1) +T(n-1,k);
%o A026758 else return T(n-1,k-1) + T(n-1,k);
%o A026758 fi;
%o A026758 end;
%o A026758 Flat(List([0..12], n-> List([0..n], k-> T(n,k) ))); # _G. C. Greubel_, Oct 29 2019
%Y A026758 Cf. A026765 (row sums).
%K A026758 nonn,tabl
%O A026758 0,5
%A A026758 _Clark Kimberling_
%E A026758 Offset corrected by _Sean A. Irvine_, Oct 25 2019
%E A026758 More terms added by _G. C. Greubel_, Oct 29 2019