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 A029515 #31 Apr 19 2021 07:35:51
%S A029515 1,2,3,6,7,9,11,14,18,21,35,75,97,102,105,175,196,291,343,375,455,485,
%T A029515 1176,2070,2151,3375,4968,11375,17059,21826,22326,28856,30079,41265,
%U A029515 47285,49605,49966,67648,92806,115074,143493,179654,963874,1525498,1527890
%N A029515 Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 22 (most significant digit on right).
%C A029515 This sequence differs from A061951 in that all least significant zeros are kept during concatenation.
%C A029515 The next term is > 1460000. - Larry Reeves, Jan 16 2002
%H A029515 Lars Blomberg, <a href="/A029515/b029515.txt">Table of n, a(n) for n = 1..48</a>
%H A029515 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029515 See A029495 for example.
%t A029515 b = 22; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%o A029515 (PARI) lista(nn, m=22) = 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 A029515 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029515 nonn,base
%O A029515 1,2
%A A029515 _Olivier Gérard_
%E A029515 More terms from Larry Reeves (larryr(AT)acm.org), Jun 01 2001
%E A029515 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002