This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091960 a(1)=1, a(2n)=a(2n-1)+(a(n)mod 2), a(2n+1)=a(2n)+1. 0
 1, 2, 3, 3, 4, 5, 6, 7, 8, 8, 9, 10, 11, 11, 12, 13, 14, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 22, 23, 23, 24, 25, 26, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 34, 35, 35, 36, 36, 37, 38, 39, 39, 40, 41, 42, 42, 43, 44, 45, 46, 47, 47, 48, 49, 50, 50, 51, 51, 52, 53, 54, 55, 56 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(4*n)=3*n iff b(2n)=0 where b(1)=1, b(2n)=(b(2n-1)+b(n)) mod 2, b(2n+1)=b(2n)+1 LINKS FORMULA a(n) is asymptotic to 3/4*n. PROG (PARI) a(n)=if(n<2, 1, if(n%2, a(n-1)+1, a(n-1)+a(n/2)%2)) CROSSREFS Sequence in context: A247983 A127036 A108789 * A162621 A180446 A095394 Adjacent sequences:  A091957 A091958 A091959 * A091961 A091962 A091963 KEYWORD nonn AUTHOR Benoit Cloitre, Mar 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 16:32 EST 2019. Contains 319309 sequences. (Running on oeis4.)