cp's OEIS Frontend

A255594 Convert n to base 9, move least significant digit to most significant digit and convert back to base 10.

%I A255594 #32 Jun 14 2024 19:19:10
%S A255594 0,1,2,3,4,5,6,7,8,1,10,19,28,37,46,55,64,73,2,11,20,29,38,47,56,65,
%T A255594 74,3,12,21,30,39,48,57,66,75,4,13,22,31,40,49,58,67,76,5,14,23,32,41,
%U A255594 50,59,68,77,6,15,24,33,42,51,60,69,78,7,16,25,34,43,52,61
%N A255594 Convert n to base 9, move least significant digit to most significant digit and convert back to base 10.
%C A255594 Fixed points of the transform are listed in A048334.
%C A255594 For more than 2 base-9 digits, reversal and cyclic shifts of a number start to differ, so this sequence differs from A030108. - _Alonso del Arte_, Mar 22 2015
%H A255594 Paolo P. Lava, <a href="/A255594/b255594.txt">Table of n, a(n) for n = 0..1000</a>
%F A255594 a(9*n) = n.
%F A255594 a(9^n) = 9^(n-1).
%e A255594 13 in base 9 is 14: moving the least significant digit as the most significant one we have 41 that is 37 in base 10.
%p A255594 with(numtheory): P:=proc(q,h) local a,b,k,n; print(0);
%p A255594 for n from 1 to q do
%p A255594 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 A255594 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 A255594 print(b); od; end: P(10^4,9);
%t A255594 roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Prepend[Most@ w, Last@ w]]; b = 9; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 69]) (* _Michael De Vlieger_, Mar 04 2015 *)
%t A255594 Table[FromDigits[RotateRight[IntegerDigits[n,9]],9],{n,0,80}] (* _Harvey P. Dale_, Jun 14 2024 *)
%Y A255594 Cf. A030108, A038572, A048334, A255588-A255593, A048787, A255689-A255693.
%K A255594 nonn,easy,base
%O A255594 0,3
%A A255594 _Paolo P. Lava_, Mar 02 2015