Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098971
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098971 a(0)=1; for n > 0, a(n)=a(floor(n/2))+2*a(floor(n/4)). +0
1
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; listen)
OFFSET

0,2

FORMULA

n>0, a(n)=(1/3)*(8*2^(floor(log(n)/log(2)))+(-1)^(floor(log(n)/log(2))))

PROGRAM

(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: A076877 A120841 A049757 this_sequence A093572 A118132 A089167

Adjacent sequences: A098968 A098969 A098970 this_sequence A098972 A098973 A098974

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 23 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research