|
|
A029519
|
|
Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 2 (most significant digit on right).
|
|
141
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence differs from A061955 in that all least significant zeros are removed before concatenation.
|
|
LINKS
|
|
|
EXAMPLE
|
7 is in the sequence as the left concatenation of numbers <= 7 is 7654321 which gives 7654321 -> (111)(011)(101)(001)(11)(01)(1) base 2 -> 1111110111111_2 = 8127, and 7 divides 8127.
|
|
MATHEMATICA
|
b = 2; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* Robert Price, Mar 13 2020 *)
|
|
PROG
|
(J) mkcat =: 13 : 'y +. #. ; #:&.> |.&.#:&.> |. >:i. y'
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
Additional comments and example from Larry Reeves (larryr(AT)acm.org), May 25 2001
|
|
STATUS
|
approved
|
|
|
|