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 A362119 #26 Nov 27 2023 14:47:03 %S A362119 1,12,123,1234,12345,1234510,123451011,12345101112,1234510111213, %T A362119 123451011121314,12345101112131415,1234510111213141520, %U A362119 123451011121314152021,12345101112131415202122,1234510111213141520212223,123451011121314152021222324,12345101112131415202122232425 %N A362119 Concatenate the base-6 strings for 1,2,...,n. %C A362119 The smallest prime occurs at n = 12891. - _Michael S. Branicky_, Apr 20 2023 %C A362119 The b-file has only 313 terms, since a(314) has 1001 digits. %H A362119 Michael S. Branicky, <a href="/A362119/b362119.txt">Table of n, a(n) for n = 1..313</a> %t A362119 A362119[n_]:=FromDigits[Flatten[IntegerDigits[Range[n],6]]];Array[A362119,20] (* _Paolo Xausa_, Nov 27 2023 *) %o A362119 (Python) %o A362119 from sympy.ntheory import digits %o A362119 from itertools import count, islice %o A362119 def agen(s="", base=6): yield from (int(s:=s+"".join(map(str, digits(n, base)[1:]))) for n in count(1)) %o A362119 print(list(islice(agen(), 20))) %Y A362119 Cf. A362118, A058935, A360502, A117640, A362117, A007908. %K A362119 nonn,base %O A362119 1,2 %A A362119 _Michael S. Branicky_ and _N. J. A. Sloane_, Apr 19 2023