OFFSET
0,3
FORMULA
Recurrence: a(2n) = 3*a(n) + n, a(2n+1) = 3*a(n) + n + 1.
G.f.: 1/(1-x) * Sum_{k>=0} 3^k*t/(1-t^2), where t = x^2^k.
a(n) = 2*A005836(n+1) - n.
a(n) = n + 2*Sum_{k>=1} 3^(k-1)*floor(n/2^k). - Ridouane Oudra, May 16 2026
MATHEMATICA
Join[{0}, Accumulate[3^IntegerExponent[Range[64], 2]]] (* Harvey P. Dale, May 20 2025 *)
PROG
(PARI) a(n)=sum(k=1, n, 3^valuation(k, 2))
(PARI) a(n)=if(n<1, 0, if(n%2==0, 3*a(n/2)+n/2, 3*a((n-1)/2)+(n+1)/2))
(Python)
def A091311(n): return (int(bin(n)[2:], 3)<<1)-n # Chai Wah Wu, Jul 07 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Feb 24 2004
STATUS
approved
