cp's OEIS Frontend

A255591 Convert n to base 6, move least significant digit to most significant digit and convert back to base 10.

%I A255591 #33 Jan 03 2025 18:39:19
%S A255591 0,1,2,3,4,5,1,7,13,19,25,31,2,8,14,20,26,32,3,9,15,21,27,33,4,10,16,
%T A255591 22,28,34,5,11,17,23,29,35,6,42,78,114,150,186,7,43,79,115,151,187,8,
%U A255591 44,80,116,152,188,9,45,81,117,153,189,10,46,82,118,154,190,11
%N A255591 Convert n to base 6, move least significant digit to most significant digit and convert back to base 10.
%C A255591 a(6*n) = n.
%C A255591 Fixed points of the transform are listed in A048331.
%H A255591 Indranil Ghosh, <a href="/A255591/b255591.txt">Table of n, a(n) for n = 0..46656</a> (terms 0..1000 from  Paolo P. Lava)
%e A255591 16 in base 6 is 24: moving the least significant digit to the most significant one we have 42 that is 26 in base 10.
%p A255591 with(numtheory): P:=proc(q,h) local a,b,k,n; print(0);
%p A255591 for n from 1 to q do
%p A255591 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 A255591 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 A255591 print(b); od; end: P(10^4,6);
%t A255591 roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Prepend[Most@ w, Last@ w]]; b = 6; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 66]) (* _Michael De Vlieger_, Mar 04 2015 *)
%o A255591 (Python)
%o A255591 def A255591(n):
%o A255591     x=A007092(n)
%o A255591     return int(x[-1]+x[:-1],6) # _Indranil Ghosh_, Feb 03 2017
%Y A255591 Cf. A030105, A038572, A048331, A255588-A255590, A255592-A255594, A048787, A255689-A255693.
%K A255591 nonn,easy,base
%O A255591 0,3
%A A255591 _Paolo P. Lava_, Mar 02 2015