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 A029480 #26 May 31 2024 05:51:47
%S A029480 1,5,15,24,25,40,75,104,120,200,271,600,696,744,1571,1779,2425,3920,
%T A029480 4592,7213,9615,11417,11681,11805,14928,18000,18800,22597,54000,82640,
%U A029480 119760,177000,218600,461625,547592,547640,561975,641800,861400,1133368,1575435,2628185,3114965,3992975,4455400,5902975,6404952,17862425,24200673,24629515,26758880,29749915,29831776,42704185,46355725,53164695,54814075,69283747,85552800
%N A029480 Numbers k that divide the (left) concatenation of all numbers <= k written in base 11 (most significant digit on left).
%C A029480 a(89) > 3*10^10. - _Jason Yuen_, May 31 2024
%H A029480 Jason Yuen, <a href="/A029480/b029480.txt">Table of n, a(n) for n = 1..88</a>
%H A029480 <a href="/index/N#concat">Index entries for related sequences</a>
%t A029480 b = 11; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[#, b], c], b], #] &] (* _Robert Price_, Mar 12 2020 *)
%Y A029480 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029480 nonn,base
%O A029480 1,2
%A A029480 _Olivier Gérard_
%E A029480 More terms from Andrew Gacek (andrew(AT)dgi.net), Feb 20 2000
%E A029480 More terms from Larry Reeves (larryr(AT)acm.org), May 24 2001
%E A029480 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029480 a(41)-a(59) from _Max Alekseyev_, May 16 2011