login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 1
1, 2, 3, 4, 5, 7, 7, 9, 9, 11, 12, 13, 13, 15, 15, 17, 17, 19 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
CROSSREFS
Sequence in context: A122411 A339378 A341156 * A341141 A325353 A117174
KEYWORD
nonn,more
AUTHOR
David Broadhurst, Aug 17 2022 (entry created by N. J. A. Sloane, Apr 24 2022)
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 07:46 EDT 2024. Contains 372020 sequences. (Running on oeis4.)