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 A088163 #12 Feb 20 2022 19:02:18
%S A088163 0,1,2,3,7,10,15,31,42,63,127,170,255,511,682,1023,2047,2730,4095,
%T A088163 8191,10922,16383,32767,43690,65535,131071,174762,262143,524287,
%U A088163 699050,1048575,2097151,2796202,4194303,8388607,11184810,16777215,33554431,44739242,67108863
%N A088163 Numbers for which rotating one binary place to the right less rotating one binary place to the left is equal to zero.
%C A088163 n is a member iff n is of the form 2^n -1 (A000225) or A000975(2n).
%H A088163 Colin Barker, <a href="/A088163/b088163.txt">Table of n, a(n) for n = 0..1000</a>
%H A088163 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,5,0,0,-4).
%F A088163 Numbers n such that A038572(n) - A006257(n) = A088161(n) = 0.
%F A088163 From _Colin Barker_, May 14 2016: (Start)
%F A088163 a(n) = 5*a(n-3)-4*a(n-6) for n>5.
%F A088163 G.f.: x*(1+x)*(1+x+2*x^2) / ((1-x)*(1+x+x^2)*(1-4*x^3)).
%F A088163 (End)
%t A088163 f[n_] := FromDigits[ RotateRight[ IntegerDigits[n, 2]], 2] - FromDigits[ RotateLeft[ IntegerDigits[n, 2]], 2]; Select[ Range[33560000], f[ # ] == 0 &]
%t A088163 (* Or *) Union[ Join[ Table[2^n - 1, {n, 0, 25}], Table[ Ceiling[2(2^n - 1)/3], {n, 2, 24, 2}]]]
%t A088163 LinearRecurrence[{0,0,5,0,0,-4},{0,1,2,3,7,10},40] (* _Harvey P. Dale_, Feb 20 2022 *)
%o A088163 (PARI) concat(0, Vec(x*(1+x)*(1+x+2*x^2) / ((1-x)*(1+x+x^2)*(1-4*x^3)) + O(x^50))) \\ _Colin Barker_, May 14 2016
%Y A088163 Cf. A000225, A000975.
%K A088163 nonn,easy
%O A088163 0,3
%A A088163 _Robert G. Wilson v_, Sep 13 2003