cp's OEIS Frontend

A029536 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 19 (most significant digit on right and removing all least significant zeros before concatenation).

%I A029536 #23 Jan 13 2025 13:23:51
%S A029536 1,3,9,21,28,36,48,87,100,156,189,208,300,547,999,1155,1395,1524,3267,
%T A029536 6867,7663,8880,9295,30021,38740,49861,86427,379248,454269,657860,
%U A029536 850824,1589897,3523500,8855295
%N A029536 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 19 (most significant digit on right and removing all least significant zeros before concatenation).
%C A029536 This sequence differs from A061972 in that all least significant zeros are removed before concatenation.
%C A029536 No more terms < 10^7. - _Lars Blomberg_, Sep 23 2011
%H A029536 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029536 See A029519 for example.
%t A029536 b = 19; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%o A029536 (PARI) lista(nn, m=19) = my(c, s, t); for(k=1, nn, t+=m^c*s=fromdigits(Vecrev(digits(k, m)), m); c+=logint(s, m)+1; if(t%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Dec 05 2020
%Y A029536 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029536 nonn,base,more
%O A029536 1,2
%A A029536 _Olivier Gérard_
%E A029536 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029536 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029536 a(29)-a(34) from _Lars Blomberg_, Sep 23 2011