CN-SMO 2016 Problem 6

Toss the coin $n$ times, assume that each time, only appear only head or tail Let $a(n)$ denote number of way that head appear in multiple of $3$ times among $n$ times Let $b(n)$ denote numbe of way that head appear in multiple of $6$ times among $n$ times $(1)$ Find $a(2016)$ and $b(2016)$ $(2)$ Find the number of positive integer $n\leq 2016$ that $2b(n)-a(n)\geq 0$