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 A127094 #16 Mar 08 2021 16:40:16
%S A127094 1,2,1,3,0,1,4,0,2,1,5,0,0,0,1,6,0,0,3,2,1,7,0,0,0,0,0,1,8,0,0,0,4,0,
%T A127094 2,1,9,0,0,0,0,0,3,0,1,10,0,0,0,0,5,0,0,2,1,11,0,0,0,0,0,0,0,0,0,1
%N A127094 Triangle, reversal of A127093.
%H A127094 G. C. Greubel, <a href="/A127094/b127094.txt">Rows n = 1..30 of the triangle, flattened</a>
%F A127094 Reversed rows of A127093.
%F A127094 T(n, K) = mod(n, k-n-1) - mod(n+1, k-n-1) + 1. - _Mats Granvik_, Sep 02 2007
%e A127094 First few rows of the triangle are:
%e A127094 1;
%e A127094 2, 1;
%e A127094 3, 0, 1;
%e A127094 4, 0, 2, 1;
%e A127094 5, 0, 0, 0, 1;
%e A127094 6, 0, 0, 3, 2, 1;
%e A127094 ...
%t A127094 Table[Mod[n, k-n-1] - Mod[n+1, k-n-1] +1, {n,12}, {k,n}]//Flatten (* _G. C. Greubel_, Mar 08 2021 *)
%o A127094 (Sage) flatten([[n%(k-n-1) - (n+1)%(k-n-1) + 1 for k in [1..n]] for n in [1..12]]) # _G. C. Greubel_, Mar 08 2021
%o A127094 (Magma) [n mod (k-n-1) - (n+1) mod (k-n-1) + 1: k in [1..n], n in [1..12]]; // _G. C. Greubel_, Mar 08 2021
%Y A127094 Cf. A000203 (row sums), A126988, A127093.
%K A127094 nonn,tabl
%O A127094 1,2
%A A127094 _Gary W. Adamson_, Jan 05 2007