The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A029523 Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 6 (most significant digit on right). 1
 1, 5, 19, 35, 55, 85, 505, 12047, 113935, 1107173 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This sequence differs from A061959 in that all least significant zeros are removed before concatenation. No more terms < 10^7. [Lars Blomberg, Sep 05 2011] LINKS EXAMPLE See A029519 for example. MATHEMATICA b = 6; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[IntegerDigits[IntegerReverse[#, b], b], c], b], #] &] (* Robert Price, Mar 13 2020 *) CROSSREFS Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978. Sequence in context: A324557 A255413 A031041 * A289289 A213631 A242589 Adjacent sequences: A029520 A029521 A029522 * A029524 A029525 A029526 KEYWORD nonn,base 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(8)-a(9) from Larry Reeves (larryr(AT)acm.org), Jun 11 2001 a(10) from Lars Blomberg, Sep 05 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 00:20 EST 2022. Contains 358698 sequences. (Running on oeis4.)