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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096273 a(0)=0, then a(n)=a(n-1)+(n-1) if n is odd, a(n)=a(n/2)+n/2 otherwise. 2
 0, 0, 1, 3, 3, 7, 6, 12, 7, 15, 12, 22, 12, 24, 19, 33, 15, 31, 24, 42, 22, 42, 33, 55, 24, 48, 37, 63, 33, 61, 48, 78, 31, 63, 48, 82, 42, 78, 61, 99, 42, 82, 63, 105, 55, 99, 78, 124, 48, 96, 73, 123, 63, 115, 90, 144, 61, 117, 90, 148, 78, 138, 109, 171, 63, 127, 96, 162, 82 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Robert Israel, Table of n, a(n) for n = 0..10000 FORMULA a(n) mod 2 = A095190(n); a(2n) mod 2= a(2n+1) mod 2 = A010060(n); a(3n)=0 mod 3 G.f. g(x) satisfies g(x) = (1+x)*g(x^2)+x^2*(3*x+1)/(x^2-1)^2. - Robert Israel, Jan 20 2021 MAPLE f:= proc(n) option remember; if n::odd then procname(n-1)+n-1 else procname(n/2)+n/2 fi end proc: f(0):= 0: map(f, [\$0..100]); # Robert Israel, Jan 20 2021 PROG (PARI) a(n)=if(n<1, 0, if(n%2, a(n-1)+n-1, a(n/2)+(n/2))) CROSSREFS Sequence in context: A222405 A146970 A078708 * A069981 A000199 A243099 Adjacent sequences: A096270 A096271 A096272 * A096274 A096275 A096276 KEYWORD nonn AUTHOR Benoit Cloitre, Jun 23 2004 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.

Last modified December 5 18:51 EST 2022. Contains 358588 sequences. (Running on oeis4.)