|
|
A061950
|
|
Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 21 (most significant digit on right).
|
|
1
|
|
|
1, 3, 5, 7, 15, 25, 80, 321, 401, 1105, 1440, 2185, 17665, 26585, 132920, 287216, 659355, 1267785, 2096240, 3612505
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence differs from A029514 in that all least significant zeros are removed before concatenation.
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
b = 21; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* Robert Price, Mar 08 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
|
|
|
|