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 A348835 #12 Mar 03 2024 17:19:43
%S A348835 1,3,1,5,3,1,7,5,3,1,11,11,7,5,1,13,11,11,7,3,1,17,17,13,11,7,5,1,19,
%T A348835 17,17,13,11,7,3,1,23,23,19,17,13,11,7,5,1,29,29,29,23,19,17,13,11,7,
%U A348835 1,31,29,29,29,23,19,17,13,11,3,1,37,37,37,31,29,29,23,19,17,11,7,1
%N A348835 Triangle, read by rows, T(n, k) is the smallest term of A006005 strictly larger than abs(A006005(n) - A006005(k)).
%H A348835 Raghavendra Bhat, <a href="https://arxiv.org/abs/2110.14716">An Abelian Loop for Non-Composites</a>, arXiv:2110.14716 [math.GM], 2021.
%F A348835 T(n, n) = 1.
%F A348835 T(n, 1) = n.
%e A348835 Triangle begins:
%e A348835 1;
%e A348835 3, 1;
%e A348835 5, 3, 1;
%e A348835 7, 5, 3, 1;
%e A348835 11, 11, 7, 5, 1;
%e A348835 13, 11, 11, 7, 3, 1;
%e A348835 17, 17, 13, 11, 7, 5, 1;
%e A348835 ...
%o A348835 (PARI) f(n) = prime(n)-(n==1); /* A006005 */
%o A348835 T(n, k) = {my(j=1, m = abs(f(n)-f(k))); while (f(j) < m, j++); f(j);}
%Y A348835 Cf. A006005 (1 and the odd primes).
%K A348835 nonn,tabl
%O A348835 1,2
%A A348835 _Michel Marcus_, Nov 01 2021