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 A061951 #17 Jan 15 2025 02:57:24
%S A061951 1,2,3,6,7,9,11,14,18,21,63,101,119,134,177,196,255,318,360,483,1092,
%T A061951 1953,2793,3453,4302,5445,5687,5955,6027,6077,9483,16521,23026,28095,
%U A061951 76139,125199,135082,209601,518238,573590,993891,1921962,3467968,4426863,4842350
%N A061951 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 22 (most significant digit on right).
%C A061951 This sequence differs from A029515 in that all least significant zeros are removed before concatenation.
%H A061951 Lars Blomberg, <a href="/A061951/b061951.txt">Table of n, a(n) for n=1..49</a> (all terms below 10^7)
%H A061951 <a href="/index/N#concat">Index entries for related sequences</a>
%e A061951 See A061931 for example.
%t A061951 b = 22; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* _Robert Price_, Mar 08 2020 *)
%Y A061951 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A061951 nonn,base
%O A061951 1,2
%A A061951 Larry Reeves (larryr(AT)acm.org), May 24 2001
%E A061951 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002