A029529 Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 12 (most significant digit on right).

1, 11, 143, 1771, 1931, 3223, 7409, 17017, 32417, 125477, 863203

Offset

1,2

Comments

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

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

Links

Table of n, a(n) for n=1..11.

Index entries for related sequences

Example

See A029519 for example.

Mathematica

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

Prog

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

Crossrefs

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

Sequence in context: A323029 A221580 A024140 * A214098 A015687 A051583

Adjacent sequences: A029526 A029527 A029528 * A029530 A029531 A029532

Keyword

nonn,base,more

Author

Olivier Gérard

Extensions

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

Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001

a(11) from Lars Blomberg, Sep 14 2011

Status

approved