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

%I #9 Jul 12 2013 08:52:51

%S 10113,101343,1020412245351433,1023,10262054413,103,

%T 1034482758620689655172413793,2076

%N 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.

%C 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.

%H W. A. Hoffman III, <a href="/A159774/a159774.pdf">Algorithm to compute terms.</a>

%e 2076b11/3=762b11 (2745/3=915) and 3*2076b11=6207b11 (3*2745=8235).

%Y Cf. A023060, A159774.

%Y See A160116 for these numbers written in base 10.

%K base,nonn,fini,full

%O 4,1

%A William A. Hoffman III (whoff(AT)robill.com), Apr 24 2009

%E Edited by _Ray Chandler_, May 02 2009

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 September 9 07:24 EDT 2024. Contains 375762 sequences. (Running on oeis4.)