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 23:31:15
%S 1,3,32,320,544,2048,3331,5833,32281,125120,145760,317621,889760,
%T 7371043
%N Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 9 (most significant digit on right).
%C This sequence differs from A061938 in that all least significant zeros are kept during concatenation.
%C No more terms < 10^7. - _Lars Blomberg_, Oct 04 2011
%H <a href="/index/N#concat">Index entries for related sequences</a>
%e See A029495 for example.
%t b = 9; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 12 2020 *)
%o (PARI) lista(nn, m=9) = my(s, t); for(k=1, nn, s=k; while(s, t=t*m+s%m; s\=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 _Olivier Gérard_
%E Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E a(13)-a(14) from _Lars Blomberg_, Oct 04 2011