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.

A352998 a(n) is the least k > 0 such that the binary expansions of A109812(n) and A109812(n + 2*k) have no common 1-bit.

This page as a plain text file.
%I A352998 #10 Apr 16 2022 09:33:57
%S A352998 1,2,1,2,2,1,3,1,2,10,2,3,1,2,1,11,2,6,2,10,4,8,3,4,2,3,1,6,1,4,8,6,
%T A352998 13,2,12,2,5,5,18,2,9,4,2,3,7,2,3,1,2,1,12,9,6,15,2,4,9,6,2,12,8,4,7,
%U A352998 3,6,2,5,8,4,8,2,17,4,5,4,16,2,19,3,14,5,7
%N A352998 a(n) is the least k > 0 such that the binary expansions of A109812(n) and A109812(n + 2*k) have no common 1-bit.
%H A352998 Rémy Sigrist, <a href="/A352998/a352998.png">Scatterplot of the first million terms</a>
%H A352998 Rémy Sigrist, <a href="/A352998/a352998.txt">C++ program</a>
%F A352998 a(n) >= A352999(n).
%e A352998 For n = 18:
%e A352998 - we have:
%e A352998       k  A109812(18+2*k)  A109812(18) AND A109812(18+2*k)
%e A352998       -  ---------------  -------------------------------
%e A352998       0               33                               33
%e A352998       1               11                                1
%e A352998       2               19                                1
%e A352998       3               21                                1
%e A352998       4               13                                1
%e A352998       5               15                                1
%e A352998       6               22                                0
%e A352998 - so a(18) = 6.
%o A352998 (C++) See Links section.
%Y A352998 Cf. A109812, A352773 (positions of 1's), A352999.
%K A352998 nonn,base
%O A352998 1,2
%A A352998 _Rémy Sigrist_, Apr 14 2022