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 A061969 #13 Mar 09 2020 14:43:56 %S A061969 1,3,5,9,15,25,41,1149,1755,2009,2815,6981,19117,65515,218715,315735, %T A061969 405845,1511139,2165055,7076685 %N A061969 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 16 (most significant digit on right). %C A061969 This sequence differs from A029533 in that all least significant zeros are kept during concatenation. %C A061969 No more terms < 8*10^6. %H A061969 <a href="/index/N#concat">Index entries for related sequences</a> %e A061969 See A061955 for example. %t A061969 b = 16; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[Reverse[IntegerDigits[#, b]], c], b], #] &] (* _Robert Price_, Mar 09 2020 *) %Y A061969 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978. %K A061969 nonn,base,more %O A061969 1,2 %A A061969 Larry Reeves (larryr(AT)acm.org), May 24 2001 %E A061969 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002 %E A061969 a(18)-a(20) from _Lars Blomberg_, Aug 06 2011