OFFSET
0,2
FORMULA
a(2k+1) = 2 + 2*a(k), a(2k+2) = 2 + a(k) + a(k+1), for k > 0.
a(n) is a multiple of n iff n = 2^m-1 for some m >= 0.
MAPLE
a:= n-> 2*n-(h-> min(n+1-h, 2*h-n-1))(2^ilog2(n+1)):
seq(a(n), n=0..77); # Alois P. Heinz, Oct 27 2025
PROG
(PARI) apply( {a(n)=2*n-A080776(n)}, [0..99])
(Python)
def A384096(n): return max(n-1+(m:=1<<(n+1).bit_length()-1), 3*n-(m<<1)+1) # Chai Wah Wu, Oct 31 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
M. F. Hasler, Oct 27 2025
STATUS
approved
