A352922 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 m(n).

0, 1, 4, 3, 6, 6, 8, 8, 10, 10, 11, 14, 14, 16, 18, 18, 18, 20

Offset

1,3

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.

(We assume A109812(0)=0 in order to get m(1)=0.)

Links

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

Crossrefs

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

Sequence in context: A261723 A362449 A021233 * A290612 A292616 A071901

Adjacent sequences: A352919 A352920 A352921 * A352923 A352924 A352925

Keyword

nonn,more

Author

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

Status

approved