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 A029518 #34 Apr 19 2021 07:35:41
%S A029518 1,3,5,9,15,21,39,83,96,288,303,864,1824,2421,2496,2592,2817,3328,
%T A029518 6299,9440,13632,18592,26049,64857,69696,71904,79872,94848,120384,
%U A029518 258111,287232,319319,476736,524992,706368,904281,1817583,2003520,3156192,4479904,7460741
%N A029518 Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 25 (most significant digit on right).
%C A029518 This sequence differs from A061954 in that all least significant zeros are kept during concatenation.
%H A029518 Lars Blomberg, <a href="/A029518/b029518.txt">Table of n, a(n) for n = 1..42</a>
%H A029518 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029518 See A029495 for example.
%t A029518 b = 25; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%o A029518 (PARI) lista(nn, m=25) = my(s, t); for(k=1, nn, s=k; while(s, t=t*m+s%m; s\=m); if(t%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Dec 05 2020
%Y A029518 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029518 nonn,base
%O A029518 1,2
%A A029518 _Olivier Gérard_
%E A029518 More terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029518 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029518 a(33) and beyond from _Lars Blomberg_, Oct 14 2011