Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Dec 05 2020 11:46:16
%S 1,11,44,77,143,1364,7372,18131,22151,198967,275464,371731,544005,
%T 849277,1684689,2001879,2895915,3678653,4479352,5673591,6624420,
%U 6895647
%N Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right).
%C This sequence differs from A029540 in that all least significant zeros are kept during concatenation.
%C No more terms < 7*10^6. - _Lars Blomberg_, Jul 25 2011
%H <a href="/index/N#concat">Index entries for related sequences</a>
%e See A061955 for example.
%t b = 23; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[Reverse[IntegerDigits[#, b]], c], b], #] &] (* _Robert Price_, Mar 09 2020 *)
%o (PARI) lista(nn, m=23) = my(c, t); for(k=1, nn, t+=m^c*fromdigits(Vecrev(digits(k, m)), m); c+=logint(m*k, m); if(t%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Dec 05 2020
%Y Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K nonn,base,more
%O 1,2
%A Larry Reeves (larryr(AT)acm.org), May 24 2001
%E Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002; Aug 25 2002
%E a(14)-a(22) from _Lars Blomberg_, Jul 25 2011