|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|