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 A377292 #35 Jan 04 2025 22:24:40 %S A377292 0,1,6,7,20,18,21,19,120,108,126,106,121,109,127,107,272,360,260,380, %T A377292 278,366,258,378,273,361,261,381,279,367,259,379,1632,1904,1560,1800, %U A377292 1652,1892,1548,1820,1638,1910,1566,1806,1650,1890,1546,1818,1633,1905,1561,1801 %N A377292 Terms of A118666 as produced by the program given there (without the final sorting). %H A377292 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 1.19.3 "Fixed points of the blue code", p.52-54, with a(n) = blue_fixed_point(n). %H A377292 <a href="/index/Ge#GF2X">Index entries for sequences operating on (or containing) GF(2)[X]-polynomials</a> %F A377292 a(2^k) = A117998(k). %o A377292 (C++) // See Fxtbook link, "blue_fixed_point()". %o A377292 (Python) %o A377292 A048726 = lambda n: (n << 2) ^ (n << 1) %o A377292 def a(n): %o A377292 if n == 0: return 0 %o A377292 f, s = 1, n %o A377292 while s > 1: %o A377292 f = A048726(f) | (s & 1) %o A377292 s >>= 1 %o A377292 return f %o A377292 print([a(n) for n in range(0, 52)]) %Y A377292 Cf. A118666, A117998. %K A377292 nonn %O A377292 0,3 %A A377292 _Darío Clavijo_, Dec 27 2024