|
|
A029527
|
|
Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 10 (most significant digit on right).
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence differs from A061963 in that all least significant zeros are removed before concatenation.
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
b = 10; 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=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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
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
|
|
STATUS
|
approved
|
|
|
|