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 A029508 #20 Dec 05 2020 23:31:34
%S A029508 1,3,5,7,32,77,93,96,160,224,352,889,941,2275,3421,10368,23744,31104,
%T A029508 40832,168111,303296,3496928,6149591,8275552,8333395,9774432
%N A029508 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 15 (most significant digit on right).
%C A029508 This sequence differs from A061944 in that all least significant zeros are kept during concatenation.
%C A029508 No more terms < 10^7. - _Lars Blomberg_, Oct 08 2011
%H A029508 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029508 See A029495 for example.
%t A029508 b = 15; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%o A029508 (PARI) lista(nn, m=15) = 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 A029508 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029508 nonn,base,more
%O A029508 1,2
%A A029508 _Olivier Gérard_
%E A029508 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029508 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), Jun 01 2001
%E A029508 a(22)-a(26) from _Lars Blomberg_, Oct 08 2011