|
%I #6 May 01 2013 21:06:46
%S 1012,102,102342,1031345242,103524563142,1042,10467842,
%T 105263157894736842,316,10631694842
%N Least number m, written in base n, such that m/2 is obtained merely by shifting the leftmost digit of m to the right end, and 2m by shifting the rightmost digit of m to the left end, digits defined in base n.
%C 10(b2) and 31(b5) do not both halve and double by rotations. No 2-digit answer can meet the description, so the sequence begins with a base 3 value.
%H W. A. Hoffman III, <a href="/A159774/a159774.pdf">Algorithm to compute terms.</a>
%e 1042(b8)/2 = 421(b8) and 1042(b8)*2 = 2104(b8)
%e 316 (base 11) = 380 (base 10), 163 (base 11) = 190 (base 10), 631 (base 11) = 760 (base 10).
%Y Cf. A092697, A097717, A094224, A094676, A158877.
%Y See A147514 for these numbers written in base 10.
%K base,nonn,fini,full
%O 3,1
%A William A. Hoffman III (whoff(AT)robill.com), Apr 21 2009
%E Offset corrected by _N. J. A. Sloane_, Apr 23 2009
%E a(11) corrected. To indicate that terms from base n=13 on need digits larger than 9, keywords fini, full added. - _Ray Chandler_ and _R. J. Mathar_, Apr 23 2009
%E Edited by _Ray Chandler_, May 02 2009
| 