As in the title. Is it possible that $[A,B]\neq0$, but $[A,e^B]=0$? I tried expanding the exponential and using $[A,B^n]=\sum_k {n\choose k} B^{n-k}[A,B]B^k $ but this doesn't seem to give any insight.
I'm inclined to think the answer is yes, because a sum of terms being $0$ is a weaker requirement than each term being $0$, but I was wondering if there's a clearer way to see it.
EDIT: in light of lisyarus' answer, what if the matrices in question are hermitian and have real eigenvalues?