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 A348575 #78 Jan 01 2022 00:16:59
%S A348575 1,2,4,7,11,16,22,29,37,10,11,13,16,20,25,31,38,46,55,65,76,88,101,
%T A348575 115,130,146,163,181,200,220,241,263,286,310,335,361,388,19,20,22,25,
%U A348575 29,34,40,47,55,64,74,85,97,110,124,139,155,172,190,209,229,250,272,295
%N A348575 Irregular triangle read by rows: T(n, k) = T(n, k-1) + k - 1 if digsum(T(n, k-1)) is already in the sequence, otherwise start a new row with T(n+1, 1) = digsum(T(n, k-1)); T(1, 1) = 1.
%C A348575 Terms computed by _Claudio Meller_.
%C A348575 From _Jon E. Schoenfield_, Dec 04 2021: (Start)
%C A348575 The 31996289225th term of the sequence is T(30, 1) = 167, so row 30 begins with the terms 167, 168, 170, 173, 177, 182, 188, 195, 203, 212, 222, 233, 245, 258, ..., i.e., T(30, k) = 167 + A000217(k-1), and each term in row 30 is congruent to 2, 5, 6, or 8 (mod 9). The terms in row 30 include the first appearances of the values 167 (at T(30, 1)), 177 (at T(30, 5)), 203 (at T(30, 9)), and 233 (T(30, 12)), .... After those first appearances, the smallest numbers that have not yet appeared are 160, 169, 208, 214, 216, 219, 224, 226, 237, 240, 244, 251, 255, 257, .... Of those, the only ones congruent to 2, 5, 6, or 8 (mod 9), and thus the only numbers that can be the digit sum of the final term in row 30, begin with 224, 240, 251, 257, ....
%C A348575 It seems nearly certain that a term will occur in row 30 with digit sum 224 before any of those significantly larger digit sums 240, 251, 257, etc. have appeared; i.e., it seems nearly certain that row 31 will begin with T(31, 1) = 224, and will thus consist of the terms 224, 225, 227, 230, 234, 239, 245, 252, 260, ... (each of those listed here has already appeared before row 31, except for 224), so each term in row 31 will be congruent to 0, 2, 5, or 8 (mod 9). The terms that still will not have appeared will begin with 160, 169, 208, 214, 216, 219, 226, 237, 240, 244, 251, 255, 257, ..., of which the ones congruent to 0, 2, 5, or 8 (mod 9) begin with 216, 251, 257, ....
%C A348575 Thus, row 31 will almost certainly end with a number whose digit sum is 216, causing row 32 to begin with T(32, 1) = 216, consist of terms congruent to 0, 1, 3, or 6 (mod 9), and include the first appearances of 216, 219, 226, 237, and 244, leaving 160, 169, 208, 214, 240, 251, 255, 257, ... yet to appear. Of those, the only ones congruent to 0, 1, 3, or 6 (mod 9) are 208, 240, 255, ....
%C A348575 This means that row 32 will almost certainly end with a number whose digit sum is 208, yielding T(33, 1) = 208 (and the first appearance of 214 at T(33,4)), so the terms in row 32 will be congruent to 1, 2, 4, or 7 (mod 9). (End)
%e A348575 The first three rows of the triangle are:
%e A348575 [1]: 1, 2, 4, 7, 11, 16, 22, 29, 37;
%e A348575 [2]: 10, 11, 13, 16, 20, 25, 31, 38, 46, 55, 65, 76, 88, 101, 115, 130, 146, 163, 181, 200, 220, 241, 263, 286, 310, 335, 361, 388;
%e A348575 [3]: 19, 20, 22, 25, 29, 34, 40, 47, 55, 64, 74, 85, 97, 110, 124, 139, 155, 172, 190, 209, 229, 250, 272, 295, 319, 344, 370, 397, 425, 454, 484, 515, 547, 580, 614, 649, 685, 722, 760, 799, 839, 880, 922, 965, 1009, 1054, 1100, 1147, 1195, 1244, 1294, 1345, 1397, 1450, 1504, 1559, 1615, 1672, 1730, 1789, 1849, 1910, 1972, 2035, 2099, 2164, 2230, 2297, 2365, 2434, 2504, 2575, 2647, 2720, 2794, 2869, 2945, 3022, 3100, 3179, 3259, 3340, 3422, 3505, 3589, 3674, 3760, 3847, 3935, 4024, 4114, 4205, 4297, 4390, 4484, 4579, 4675, 4772, 4870, 4969;
%e A348575 .
%e A348575 a(8) = 29 because a(7) = 22 and the sum of its digits 2+2=4 already a term, so as this is the 7th term in the increasing sequence, we add 7, and 22 + 7 = 29.
%e A348575 a(9) = 37 because a(8) = 29 and the sum of its digits 2+9=11 already a term, so as this is the 8th term in the increasing sequence so we add 8, and 29 + 8 = 37.
%e A348575 a(10) = 10 because a(9) = 37 and the sum of its digits is 10, and 10 was not already in the sequence.
%e A348575 a(11) = 11 because a(10) = 10 and is the 1st term in this new increasing sequence so we add 1, and 10 + 1 = 11.
%e A348575 a(12) = 13 because a(11) = 11 and is the 2nd term in this new increasing sequence so we add 2, and 11 + 2 = 13.
%e A348575 In the first 17 rows of the triangle we have that:
%e A348575 -------------------------------------------------------------------------------
%e A348575 First term Last term or right border Some rows
%e A348575 -------------------------------------------------------------------------------
%e A348575 T( 1,1) = 1 T( 1,9) = 37 [1, 2, 4, 7, 11, 16, 22, 29, 37]
%e A348575 T( 2,1) = 10 T( 2,28) = 388
%e A348575 T( 3,1) = 19 T( 3,100) = 4969
%e A348575 T( 4,1) = 28 T( 4,3660) = 6695998
%e A348575 T( 5,1) = 52 T( 5,2) = 53
%e A348575 T( 6,1) = 8 T( 6,4) = 14 [8, 9, 11, 14]
%e A348575 T( 7,1) = 5 T( 7,34) = 566
%e A348575 T( 8,1) = 17 T( 8,279) = 38798
%e A348575 T( 9,1) = 35 T( 9,1342) = 899846
%e A348575 T(10,1) = 44 T(10,24486) = 299769899
%e A348575 T(11,1) = 68 T(11,41) = 888
%e A348575 T(12,1) = 24 T(12,4) = 30 [24, 25, 27, 30]
%e A348575 T(13,1) = 3 T(13,9) = 39
%e A348575 T(14,1) = 12 T(14,37) = 678
%e A348575 T(15,1) = 21 T(15,3373) = 5686899
%e A348575 T(16,1) = 51 T(16,30332) = 459999997
%e A348575 T(17,1) = 70 T(17,10768) = 57969598
%t A348575 seq[len_] := Module[{s = {1}, i = 1, d}, While[Length[s] < len, If[MemberQ[s, (d = Plus @@ IntegerDigits[s[[-1]]])], AppendTo[s, s[[-1]] + i], AppendTo[s, d]; i = 0]; i++]; s]; seq[50] (* _Amiram Eldar_, Oct 23 2021 *)
%Y A348575 Column 1 gives A349548.
%Y A348575 Row lengths give A349547.
%Y A348575 Right border gives A349742.
%Y A348575 Cf. A000217, A007953 (digsum), A348433, A348400, A348483.
%K A348575 nonn,base,tabf
%O A348575 1,2
%A A348575 _Rodolfo Kurchan_, Oct 23 2021
%E A348575 Definition clarified by _Amiram Eldar_ at my request. - _N. J. A. Sloane_, Nov 19 2021