cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A255690 Convert n to base 5, move the most significant digit to the least significant one and convert back to base 10.

This page as a plain text file.
%I A255690 #19 Mar 14 2015 14:31:10
%S A255690 0,1,2,3,4,1,6,11,16,21,2,7,12,17,22,3,8,13,18,23,4,9,14,19,24,1,6,11,
%T A255690 16,21,26,31,36,41,46,51,56,61,66,71,76,81,86,91,96,101,106,111,116,
%U A255690 121,2,7,12,17,22,27,32,37,42,47,52,57,62,67,72,77,82,87,92
%N A255690 Convert n to base 5, move the most significant digit to the least significant one and convert back to base 10.
%C A255690 a(5*n) = 1.
%C A255690 Fixed points of the transform are listed in A048330.
%H A255690 Paolo P. Lava, <a href="/A255690/b255690.txt">Table of n, a(n) for n = 0..1000</a>
%e A255690 14 in base 5 is 24: moving the least significant digit as the most significant one we have 42 that is 22 in base 10.
%p A255690 with(numtheory): P:=proc(q,h) local a,b,k,n; print(0);
%p A255690 for n from 1 to q do
%p A255690 a:=convert(n,base,h); b:=[]; for k from 1 to nops(a)-1 do b:=[op(b),a[k]]; od; a:=[a[nops(a)],op(b)];
%p A255690 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 A255690 print(b); od; end: P(10^4,5);
%t A255690 roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Append[Rest@ w, First@ w]]; b = 5; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 68]) (* _Michael De Vlieger_, Mar 04 2015 *)
%Y A255690 Cf. A006257, A030104, A255588-A255594, A048787, A255689, A255691-A255693.
%K A255690 nonn,easy,base
%O A255690 0,3
%A A255690 _Paolo P. Lava_, Mar 02 2015