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

1, 3, 9, 27, 99, 471, 60237, 1028301, 1085427, 2851947

Offset: 1

Author

Olivier Gérard

Keywords

• nonn
• base
• more

Comments

This sequence differs from A061963 in that all least significant zeros are removed before concatenation.

No more terms < 10^7. - Lars Blomberg, Sep 12 2011

Examples

			See A029519 for example.
		

Links

• Index entries for related sequences

Crossrefs

Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.

Programs

Mathematica

b = 10; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* Robert Price, Mar 13 2020 *)

PARI

lista(nn, m=10) = 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

Extensions

Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002

Additional comments from Larry Reeves (larryr(AT)acm.org), May 25 2001. a(7) from Larry Reeves (larryr(AT)acm.org) Jan 14 2002

a(8)-a(10) from Lars Blomberg, Sep 11 2011