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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098971 a(0)=1; for n > 0, a(n)=a(floor(n/2))+2*a(floor(n/4)). 0
 1, 3, 5, 5, 11, 11, 11, 11, 21, 21, 21, 21, 21, 21, 21, 21, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 171, 171, 171, 171, 171 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA n>0, a(n)=(1/3)*(8*2^(floor(log(n)/log(2)))+(-1)^(floor(log(n)/log(2)))) PROG (PARI) a(n)=if(n<1, 1, (1/3)*(8*2^(floor(log(n)/log(2)))+(-1)^(floor(log(n)/log(2))))) CROSSREFS a(2^n) gives the Jacobsthal sequence A001045(n+3). Cf. A001045, A007731. Sequence in context: A190864 A155537 A164663 * A093572 A317650 A240731 Adjacent sequences:  A098968 A098969 A098970 * A098972 A098973 A098974 KEYWORD nonn AUTHOR Benoit Cloitre, Oct 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 June 29 18:25 EDT 2022. Contains 354913 sequences. (Running on oeis4.)