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 A029527 #27 Jan 13 2025 13:21:22
%S A029527 1,3,9,27,99,471,60237,1028301,1085427,2851947
%N A029527 Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 10 (most significant digit on right and removing all least significant zeros before concatenation).
%C A029527 This sequence differs from A061963 in that all least significant zeros are removed before concatenation.
%C A029527 No more terms < 10^7. - _Lars Blomberg_, Sep 12 2011
%H A029527 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029527 See A029519 for example.
%t A029527 b = 10; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%o A029527 (PARI) lista(nn, m=10) = my(c, s, t); for(k=1, nn, t+=m^c*s=fromdigits(Vecrev(digits(k, m)), m); c+=logint(s, m)+1; if(t%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Dec 05 2020
%Y A029527 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029527 nonn,base,more
%O A029527 1,2
%A A029527 _Olivier Gérard_
%E A029527 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029527 Additional comments from Larry Reeves (larryr(AT)acm.org), May 25 2001. a(7) from Larry Reeves (larryr(AT)acm.org) Jan 14 2002
%E A029527 a(8)-a(10) from _Lars Blomberg_, Sep 11 2011