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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A159863 a(3)(baseN) = least number m such that the quotient m/3 is obtained merely by shifting the leftmost digit (MSD) of m to the right end (LSD), and the multiple 3m by shifting the LSD of m to the MSD, in order of increasing number base, N. 1
 10113, 101343, 1020412245351433, 1023, 10262054413, 103, 1034482758620689655172413793, 2076 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 COMMENTS 1001b2, 10b3 and 51b7 do not triple by specified shift and are not included although they allow MSD->LSD shift to make m/3. No 2-digit number qualifies because the shift is an exchange (e.g., 51b7/3=15b7). 2076b11 is the highest order number of this type to be represented without letter digits. LINKS Table of n, a(n) for n=4..11. W. A. Hoffman III, Algorithm to compute terms. EXAMPLE 2076b11/3=762b11 (2745/3=915) and 3*2076b11=6207b11 (3*2745=8235). CROSSREFS Cf. A023060, A159774. See A160116 for these numbers written in base 10. Sequence in context: A269066 A161786 A157711 * A234180 A054037 A289856 Adjacent sequences: A159860 A159861 A159862 * A159864 A159865 A159866 KEYWORD base,nonn,fini,full AUTHOR William A. Hoffman III (whoff(AT)robill.com), Apr 24 2009 EXTENSIONS Edited by Ray Chandler, May 02 2009 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 August 14 12:10 EDT 2024. Contains 375162 sequences. (Running on oeis4.)