login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255589 Convert n to base 4, move the least significant digit to the most significant one and convert back to base 10. 3

%I #35 Feb 03 2017 02:34:51

%S 0,1,2,3,1,5,9,13,2,6,10,14,3,7,11,15,4,20,36,52,5,21,37,53,6,22,38,

%T 54,7,23,39,55,8,24,40,56,9,25,41,57,10,26,42,58,11,27,43,59,12,28,44,

%U 60,13,29,45,61,14,30,46,62,15,31,47,63,16,80,144,208,17,81

%N Convert n to base 4, move the least significant digit to the most significant one and convert back to base 10.

%C Fixed points of the transform are listed in A048329.

%H Indranil Ghosh, <a href="/A255589/b255589.txt">Table of n, a(n) for n = 0..16384</a> (terms 0..1000 from Paolo P. Lava)

%F a(4*k) = k.

%F a(4^k) = 4^(k-1).

%e 11 in base 4 is 23: moving the least significant digit to the most significant one we have 32 that is 14 in base 10.

%p with(numtheory): P:=proc(q,h) local a,b,k,n; print(0);

%p for n from 1 to q do

%p 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 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 print(b); od; end: P(10^4,4);

%t roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Prepend[Most@ w, Last@ w]]; b = 4; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 69]) (* _Michael De Vlieger_, Mar 04 2015 *)

%t Array[FromDigits[RotateRight[IntegerDigits[#,4]],4]&,70,0] (* _Harvey P. Dale_, Mar 01 2016 *)

%o (Python)

%o def A255589(n):

%o ....x=str(A007090(n))

%o ....return int(x[-1]+x[:-1],4) # _Indranil Ghosh_, Feb 03 2017

%Y Cf. A030103, A038572, A048329, A255588, A255590-A255594, A048787, A255689-A255693.

%K nonn,easy,base

%O 0,3

%A _Paolo P. Lava_, Mar 02 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 23 08:17 EDT 2024. Contains 375375 sequences. (Running on oeis4.)