cp's OEIS Frontend

A352921 Let c(s) denote A109812(s). Suppose c(s) = 2^n - 1, and define m(n), p(n), r(n) by m(n) = c(s-1)/2^n, p(n) = c(s+1)/2^n, r(n) = max(m(n), p(n)); sequence gives p(n).

%I A352921 #14 Apr 26 2022 13:00:59
%S A352921 1,2,3,4,5,7,7,9,9,11,12,13,13,15,15,17,17,19
%N A352921 Let c(s) denote A109812(s). Suppose c(s) = 2^n - 1, and define m(n), p(n), r(n) by m(n) = c(s-1)/2^n, p(n) = c(s+1)/2^n, r(n) = max(m(n), p(n)); sequence gives p(n).
%C A352921 The sequences m, p, r are well-defined since every number appears in A109812, and if A109812(s) = 2^n - 1, then by definition both A109812(s-1) and A109812(s+1) must be multiples of 2^n.
%C A352921 The sequences m, p, r are discussed in A352920.
%Y A352921 Cf. A109812, A113233, A352203, A352204, A352336, A352359, A352917-A352923.
%K A352921 nonn,more
%O A352921 1,2
%A A352921 _David Broadhurst_, Aug 17 2022 (entry created by _N. J. A. Sloane_, Apr 24 2022)