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 A029494 #25 Jun 30 2024 09:00:15
%S A029494 1,3,9,21,39,71,101,111,128,239,251,384,401,419,521,1152,1664,4992,
%T A029494 14976,21617,23296,29952,34437,36608,45312,51183,92928,117481,191232,
%U A029494 225043,255309,742144,910592,1374464,4074467,5427968,10461747,10528128,10897536,14721408,15387264,15529344,18626688,20796849,27863424,28862509,32013423,41722496,47329152,52894873,64367901,66678144,68195712,77870208
%N A029494 Numbers k that divide the (left) concatenation of all numbers <= k written in base 25 (most significant digit on left).
%C A029494 a(73) > 3*10^10. - _Jason Yuen_, Jun 30 2024
%H A029494 Jason Yuen, <a href="/A029494/b029494.txt">Table of n, a(n) for n = 1..72</a>
%H A029494 <a href="/index/N#concat">Index entries for related sequences</a>
%t A029494 b = 25; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[#, b], c], b], #] &] (* _Robert Price_, Mar 12 2020 *)
%Y A029494 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029494 nonn,base
%O A029494 1,2
%A A029494 _Olivier Gérard_
%E A029494 More terms from Andrew Gacek (andrew(AT)dgi.net), Feb 21 2000
%E A029494 More terms from Larry Reeves (larryr(AT)acm.org), May 24 2001
%E A029494 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029494 a(32)-a(54) from _Max Alekseyev_, May 16 2011