|
|
A061934
|
|
Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 5 (most significant digit on right).
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence differs from A029498 in that all least significant zeros are removed before concatenation.
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
cat = 0; k = 1; lst = {}; While[k < 100000, c = FromDigits@ Reverse@ IntegerDigits[k, 5]; cat = cat*10^Floor[ Log10[c] + 1] + c; If[ Mod[ FromDigits[ IntegerDigits@ cat, 5], k] == 0, AppendTo[lst, k]; Print[k]]; k++]; lst (* Robert G. Wilson v, Oct 17 2011 *)
b = 5; c = {}; Select[Range[10^4], Divisible[FromDigits[
c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* Robert Price, Mar 07 2020 *)
|
|
PROG
|
(PARI) lista(nn, m=5) = my(s, t); for(k=1, nn, s=k/m^valuation(k, m); while(s, t=t*m+s%m; s\=m); if(t%k==0, print1(k, ", "))); \\ Jinyuan Wang, Dec 05 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Larry Reeves (larryr(AT)acm.org), May 24 2001
|
|
EXTENSIONS
|
Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
|
|
STATUS
|
approved
|
|
|
|