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.

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

This page as a plain text file.
%I A255692 #21 Oct 20 2020 15:33:59
%S A255692 0,1,2,3,4,5,6,1,8,15,22,29,36,43,2,9,16,23,30,37,44,3,10,17,24,31,38,
%T A255692 45,4,11,18,25,32,39,46,5,12,19,26,33,40,47,6,13,20,27,34,41,48,1,8,
%U A255692 15,22,29,36,43,50,57,64,71,78,85,92,99,106,113,120,127,134
%N A255692 Convert n to base 7, move the most significant digit to the least significant one and convert back to base 10.
%C A255692 a(7*n) = 1.
%C A255692 Fixed points of the transform are listed in A048332.
%H A255692 Paolo P. Lava, <a href="/A255692/b255692.txt">Table of n, a(n) for n = 0..1000</a>
%e A255692 11 in base 7 is 14: moving the most significant digit as the least significant one we have 41 that is 29 in base 10.
%p A255692 with(numtheory): P:=proc(q,h) local a,b,k,n; print(0);
%p A255692 for n from 1 to q do
%p A255692 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 A255692 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 A255692 print(b); od; end: P(10^4,7);
%t A255692 roll[n_, b_] := Block[{w = IntegerDigits[n, b]}, Append[Rest@ w, First@ w]]; b = 7; FromDigits[#, b] & /@ (roll[#, b] & /@ Range[0, 68]) (* _Michael De Vlieger_, Mar 04 2015 *)
%t A255692 Table[FromDigits[RotateLeft[IntegerDigits[n,7]],7],{n,0,70}] (* _Harvey P. Dale_, Oct 20 2020 *)
%Y A255692 Cf. A006257, A030106, A255588-A255594, A255689-A255691, A255693.
%K A255692 nonn,easy,base
%O A255692 0,3
%A A255692 _Paolo P. Lava_, Mar 02 2015