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 A367347 #21 Nov 17 2023 11:21:04 %S A367347 1,12,33,66,132,153,184,225,277,349,442,466,530,535,590,595,650,656, %T A367347 722,749,846,914,963,1002,1023,1054,1095,1146,1207,1278,1359,1450, %U A367347 1451,1462,1483,1514,1555,1606,1667,1738,1819,1910,1911,1922,1943,1974,2015,2067,2139,2231,2243,2275,2327,2399 %N A367347 a(1) = 1; thereafter, a(n+1) = a(n) + x + 10*y, where x and y are respectively the first and last digits of a(n). %C A367347 This sequence and A367348 are simple models for the Commas sequence A121805. %H A367347 N. J. A. Sloane, <a href="/A367347/b367347.txt">Table of n, a(n) for n = 1..20000</a> %F A367347 a(888508) = A367348(837058) = 40000026, so a(888508+i) = A367348(837058+i) for i >= 0. - _Michael S. Branicky_, Nov 17 2023 %t A367347 NestList[#+First[IntegerDigits[#]]+10Mod[#,10]&,1,100] (* _Paolo Xausa_, Nov 17 2023 *) %o A367347 (Python) %o A367347 from itertools import islice %o A367347 def agen(): # generator of terms %o A367347 an = 1 %o A367347 while True: %o A367347 yield an %o A367347 s = str(an) %o A367347 an += int(s[0]) + 10*int(s[-1]) %o A367347 print(list(islice(agen(), 55))) # _Michael S. Branicky_, Nov 17 2023 %Y A367347 Cf. A121805, A367348. %K A367347 nonn,base %O A367347 1,2 %A A367347 _N. J. A. Sloane_, Nov 16 2023