The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061966 Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 13 (most significant digit on right). 1
 1, 3, 9, 15, 16, 33, 285, 867, 5683, 14205, 21075, 27120, 31403, 388601, 1037577, 1246064 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This sequence differs from A029530 in that all least significant zeros are kept during concatenation. No more terms < 10^7. [Lars Blomberg, Aug 15 2011] LINKS EXAMPLE See A061955 for example. MATHEMATICA b = 13; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[Reverse[IntegerDigits[#, b]], c], b], #] &] (* Robert Price, Mar 09 2020 *) CROSSREFS Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978. Sequence in context: A090158 A030342 A273323 * A085328 A291347 A062220 Adjacent sequences:  A061963 A061964 A061965 * A061967 A061968 A061969 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 a(15)-a(16) from Lars Blomberg, Aug 15 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 16:50 EDT 2021. Contains 347607 sequences. (Running on oeis4.)