A352923 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 r(n).

1, 2, 4, 4, 6, 7, 8, 9, 10, 11, 12, 14, 14, 16, 18, 18, 18, 20

Offset

1,2

Comments

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.

The sequences m, p, r are discussed in A352920.

Conjecture: r(n) >= n for n >= 1.

Links

Table of n, a(n) for n=1..18.

Crossrefs

Cf. A109812, A113233, A352203, A352204, A352336, A352359, A352917-A352922.

Sequence in context: A368200 A316945 A307370 * A014246 A026413 A342929

Adjacent sequences: A352920 A352921 A352922 * A352924 A352925 A352926

Keyword

nonn,more

Author

David Broadhurst, Aug 17 2022 (entry created by N. J. A. Sloane, Apr 24 2022)

Status

approved