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.
%I A255691 #20 Mar 02 2023 12:13:25 %S A255691 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 A255691 22,28,34,5,11,17,23,29,35,1,7,13,19,25,31,37,43,49,55,61,67,73,79,85, %U A255691 91,97,103,109,115,121,127,133,139,145,151,157,163,169,175 %N A255691 Convert n to base 6, move the most significant digit to the least significant one and convert back to base 10. %C A255691 a(6*n) = 1. %C A255691 Fixed points of the transform are listed in A048331. %H A255691 Paolo P. Lava, <a href="/A255691/b255691.txt">Table of n, a(n) for n = 0..1000</a> %e A255691 16 in base 6 is 24: moving the most significant digit as the least significant one we have 42 that is 26 in base 10. %p A255691 with(numtheory): P:=proc(q,h) local a,b,k,n; print(0); %p A255691 for n from 1 to q do %p A255691 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 A255691 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 A255691 print(b); od; end: P(10^4,6); %t A255691 roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Append[Rest@ w, First@ w]]; b = 6; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 65]) (* _Michael De Vlieger_, Mar 04 2015 *) %t A255691 Table[FromDigits[RotateLeft[IntegerDigits[n,6]],6],{n,0,70}] (* _Harvey P. Dale_, Mar 02 2023 *) %Y A255691 Cf. A006257, A030105, A255588-A255594, A255689-A255690, A255692-A255693. %K A255691 nonn,easy,base %O A255691 0,3 %A A255691 _Paolo P. Lava_, Mar 02 2015