|
|
A061945
|
|
Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 16 (most significant digit on right).
|
|
1
|
|
|
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 25, 29, 53, 110, 177, 237, 255, 2260, 3214, 4313, 4563, 7595, 20220, 35139, 167134, 180319, 186885, 315850, 439975, 559740, 4393188, 8414132, 8434510
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence differs from A029509 in that all least significant zeros are removed before concatenation.
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
b = 16; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, IntegerDigits[IntegerReverse[#, b], b]], b], #] &] (* Robert Price, Mar 08 2020 *)
|
|
PROG
|
(PARI) lista(nn, m=16) = 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; Aug 25 2002
|
|
STATUS
|
approved
|
|
|
|