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 A061941 #19 Dec 05 2020 06:36:09
%S A061941 1,2,3,4,6,11,58,77,143,209,1009,1280,6555,7564,12793,52162,59147,
%T A061941 75801,85460,127710,205439,589003,856075
%N A061941 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 12 (most significant digit on right).
%C A061941 This sequence differs from A029505 in that all least significant zeros are removed before concatenation.
%C A061941 No more terms < 10^7. - _Lars Blomberg_, Oct 20 2011
%H A061941 <a href="/index/N#concat">Index entries for related sequences</a>
%e A061941 See A061931 for example.
%t A061941 b = 12; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* _Robert Price_, Mar 08 2020 *)
%o A061941 (PARI) lista(nn, m=12) = my(s, t); for(k=1, nn, s=k/m^valuation(k, m); while(s, t=t*m+s%m; s\=m); if(t%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Dec 05 2020
%Y A061941 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A061941 nonn,base,more
%O A061941 1,2
%A A061941 Larry Reeves (larryr(AT)acm.org), May 24 2001
%E A061941 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002; Aug 25, 2002
%E A061941 a(23) from _Lars Blomberg_, Oct 20 2011