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 A367343 #13 Nov 16 2023 07:38:45 %S A367343 1,10,29,70,119,177,187,214,266,286,339,368,373,419,450,473,488,495, %T A367343 552,553,562,579,604,637,678,727,784,785,794,811,836,869,910,959,1016, %U A367343 1017,1027,1053,1095,1153,1163,1189,1231,1289,1299,1325,1367,1425,1435,1461,1503,1562 %N A367343 Compute the commas sequence starting at 1, as in A121805, except do the calculations in octal. The terms are written here in decimal (see also A367344). %H A367343 Michael De Vlieger, <a href="/A367343/b367343.txt">Table of n, a(n) for n = 1..8367</a> %e A367343 See A367344 for the calculation of the first three terms. %t A367343 b = 8; a[1] = 1; a[n_] := a[n] = For[x = Mod[a[n - 1], b]; y = 0, y <= (b - 1), y++, k = a[n - 1] + b*x + y; If[y == IntegerDigits[k, b][[1]], Return[k]]]; Array[a, 10^4] (* _Michael De Vlieger_, Nov 15 2023, after _Jean-François Alcover_ at A121805 *) %o A367343 (Python) %o A367343 from itertools import islice %o A367343 from sympy.ntheory.factor_ import digits %o A367343 def agen(): # generator of terms %o A367343 an, y = 1, 1 %o A367343 while y < 8: %o A367343 yield an %o A367343 an, y = an + 8*(an%8), 1 %o A367343 while y < 8: %o A367343 if str(digits(an+y,8)[1]) == str(y): %o A367343 an += y %o A367343 break %o A367343 y += 1 %o A367343 print(list(islice(agen(), 52))) # _Michael S. Branicky_, Nov 16 2023 %Y A367343 Cf. A121805, A367344. %K A367343 nonn,base,fini,full %O A367343 1,2 %A A367343 _N. J. A. Sloane_, Nov 15 2023