|
%I #12 Mar 11 2020 03:45:31
%S 0,16,32,48,64,80,96,112,128,144,160,176,192,208,224,240,1,17,33,49,
%T 65,81,97,113,129,145,161,177,193,209,225,241,2,18,34,50,66,82,98,114,
%U 130,146,162,178,194,210,226,242,3,19,35,51,67,83,99,115,131,147,163,179,195,211,227,243
%N Split-and-swap on 8-bit integers.
%C Split-and-swap consists of spliting a binary word into two halves and swapping the parts over to form a new word, for example 11001010 becomes 10101100.
%C There are 256 terms to the sequence. - _Harvey P. Dale_, Jul 14 2015
%H Harvey P. Dale, <a href="/A217558/b217558.txt">Table of n, a(n) for n = 0..255</a>
%e a(17)=17 because 17 is 00010001 which is invariant over the SaS rule.
%e a(19)=49 because 00010011 becomes 00110001.
%t FromDigits[#,2]&/@(Join[Take[#,-4],Take[#,4]]&/@Select[Tuples[{0,1},8], Length[#] ==8 &]) (* _Harvey P. Dale_, Jul 14 2015 *)
%o (JavaScript)
%o for (i=0;i<16;i++)
%o for (j=0;j<16;j++)
%o document.write(j*16+i+", ");
%o (PARI) A217558(n)=[1,16]*divrem(n,16) \\ - _M. F. Hasler_, Oct 07 2012
%K nonn,fini,full,base
%O 0,2
%A _Jon Perry_, Oct 06 2012
|
