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 A029477 #29 May 20 2024 10:30:41
%S A029477 1,7,13,17,35,49,65,245,305,679,889,1421,2231,2891,3623,31943,59365,
%T A029477 113141,143755,193595,367673,414545,1133461,4916897,201152387,
%U A029477 1347933505,1409041697,1462237105
%N A029477 Numbers k that divide the (left) concatenation of all numbers <= k written in base 8 (most significant digit on left).
%C A029477 No other terms below 3*10^10.
%H A029477 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029477 For k=7, we have 7654321_8 which is 2054353_10, and 2054353 = 7*293479.
%t A029477 b = 8; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[#, b], c], b], #] &] (* _Robert Price_, Mar 12 2020 *)
%o A029477 (PARI) isok(k) = my(list=List()); forstep(i=k, 1, -1, my(d=digits(i, 8)); for (j=1, #d, listput(list, d[j]));); (fromdigits(Vec(list), 8) % k) == 0; \\ _Michel Marcus_, May 20 2024
%Y A029477 Cf. A007094.
%Y A029477 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029477 nonn,base,more
%O A029477 1,2
%A A029477 _Olivier Gérard_
%E A029477 More terms from Andrew Gacek (andrew(AT)dgi.net), Feb 20 2000
%E A029477 More terms from Larry Reeves (larryr(AT)acm.org), Jun 01 2001
%E A029477 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029477 a(23)-a(24) from _Max Alekseyev_, May 14 2011
%E A029477 a(25)-a(28) from _Jason Yuen_, May 19 2024