cp's OEIS Frontend

A255593 Convert n to base 8, move least significant digit to most significant digit and convert back to base 10.

%I A255593 #24 Apr 28 2017 17:28:56
%S A255593 0,1,2,3,4,5,6,7,1,9,17,25,33,41,49,57,2,10,18,26,34,42,50,58,3,11,19,
%T A255593 27,35,43,51,59,4,12,20,28,36,44,52,60,5,13,21,29,37,45,53,61,6,14,22,
%U A255593 30,38,46,54,62,7,15,23,31,39,47,55,63,8,72,136,200,264,328
%N A255593 Convert n to base 8, move least significant digit to most significant digit and convert back to base 10.
%C A255593 a(8*n) = n.
%C A255593 a(8^n) = 8^(n-1).
%C A255593 Fixed points of the transform are listed in A048333.
%H A255593 Paolo P. Lava, <a href="/A255593/b255593.txt">Table of n, a(n) for n = 0..1000</a>
%e A255593 13 in base 8 is 15: moving the least significant digit as the most significant one we have 51 that is 41 in base 10.
%p A255593 with(numtheory): P:=proc(q,h) local a,b,k,n; print(0);
%p A255593 for n from 1 to q do
%p A255593 a:=convert(n,base,h); b:=[]; for k from 2 to nops(a) do b:=[op(b),a[k]]; od; a:=[op(b),a[1]];
%p A255593 a:=convert(a,base,h,10); b:=0; for k from nops(a) by -1 to 1 do b:=10*b+a[k]; od;
%p A255593 print(b); od; end: P(10^4,8);
%t A255593 roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Prepend[Most@ w, Last@ w]]; b = 8; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 69]) (* _Michael De Vlieger_, Mar 04 2015 *)
%t A255593 Table[FromDigits[RotateRight[IntegerDigits[n,8]],8],{n,0,70}] (* _Harvey P. Dale_, Apr 28 2017 *)
%Y A255593 Cf. A030107, A038572, A048333, A255588-A255592, A255594, A048787, A255689-A255693.
%K A255593 nonn,easy,base
%O A255593 0,3
%A A255593 _Paolo P. Lava_, Mar 02 2015