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 A139038 #23 May 16 2024 10:41:28
%S A139038 1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2,2,1,1,1,1,2,2,2,1,1,1,1,2,2,2,2,
%T A139038 1,1,1,1,2,2,3,2,2,1,1,1,1,2,2,3,3,2,2,1,1,1,1,2,2,3,4,3,2,2,1
%N A139038 Triangle read by rows: T(n,m) = A000931(m+6) if m <= floor(n/2), A000931(n+6-m) otherwise, for 0 <= m <= n.
%C A139038 The Padovan sequence is pushed back to a(-1)=1, so that the triangle is not almost all ones.
%e A139038 The triangle begins:
%e A139038 1;
%e A139038 1, 1;
%e A139038 1, 1, 1;,
%e A139038 1, 1, 1, 1;
%e A139038 1, 1, 2, 1, 1;
%e A139038 1, 1, 2, 2, 1, 1;
%e A139038 1, 1, 2, 2, 2, 1, 1;
%e A139038 1, 1, 2, 2, 2, 2, 1, 1;
%e A139038 1, 1, 2, 2, 3, 2, 2, 1, 1;
%e A139038 1, 1, 2, 2, 3, 3, 2, 2, 1, 1;
%e A139038 1, 1, 2, 2, 3, 4, 3, 2, 2, 1, 1;
%e A139038 ...
%t A139038 a[-1] = 1; a[0] = 1; a[1] = 1; a[n_] := a[n] = a[n - 2] + a[n - 3]; (* Padovan : A000931 *)
%t A139038 Table[If[m <= Floor[n/2], a[m], a[n - m]], {n, 0, 10}, {m, 0, n}]
%Y A139038 Cf. A000931, A139147.
%K A139038 nonn,tabl,less
%O A139038 0,13
%A A139038 _Roger L. Bagula_ and _Gary W. Adamson_, May 31 2008
%E A139038 Edited by _N. J. A. Sloane_, Feb 28 2009
%E A139038 Non-ASCII characters in %t line corrected by _Wouter Meeussen_, Feb 10 2013
%E A139038 Definition corrected and offset changed by _Georg Fischer_, May 16 2024