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 A352772 #13 Apr 05 2022 13:39:46 %S A352772 0,2,0,1,8,0,2,0,2,8,16,12,0,6,0,1,16,1,4,3,32,17,32,5,32,13,0,6,0,2, %T A352772 9,2,1,2,1,8,5,64,19,64,3,4,3,12,64,36,80,0,24,0,1,2,1,2,33,2,4,2,4, %U A352772 34,65,48,72,48,66,48,70,8,3,8,3,12,128,28,128,11 %N A352772 a(n) = A109812(n) AND A109812(n+2) (where AND denotes the bitwise AND operator). %C A352772 The binary expansions of two consecutive terms of A109812 have no common 1's, but the binary expansions of two terms at distance 2 can have some common 1's; this sequence gives these common 1's. %H A352772 Rémy Sigrist, <a href="/A352772/b352772.txt">Table of n, a(n) for n = 1..10000</a> %H A352772 Rémy Sigrist, <a href="/A352772/a352772.png">Log-log scatterplot of the first 2^20 terms</a> %H A352772 Rémy Sigrist, <a href="/A352772/a352772.txt">C++ program</a> %e A352772 For n = 42: %e A352772 - A109812(42) = 68, %e A352772 - A109812(44) = 28, %e A352772 - so a(42) = 68 AND 28 = 4. %o A352772 (C++) See Links section. %Y A352772 Cf. A109812, A352773. %K A352772 nonn,look,base %O A352772 1,2 %A A352772 _Rémy Sigrist_, Apr 02 2022