递推式正是正切加法公式,并且 \(a_1 = \tan\dfrac{\pi}{4}\),\(a_2 = \tan\dfrac{\pi}{6}\)。
写成 \(a_n = \tan\dfrac{\pi c_n}{12}\),其中 \(c_1 = 3\)、\(c_2 = 2\),且 \(c_{n+2} \equiv c_n + c_{n+1} \pmod{12}\)。序列 \(c_n\) 为 \[ \begin{gathered} 3, 2, 5, 7, 0, 7, 7, 2, \\ 9, 11, 8, 7, 3, 10, 1, 11, \\ 0, 11, 11, 10, 9, 7, 4, 11, \ldots \end{gathered} \] 其周期为 \(24\)。
因为 \(2009 = 24\cdot 83 + 17\),所以 \(c_{2009} = c_{17} = 0\),从而 \(a_{2009} = \tan 0 = 0\),\(|a_{2009}| = 0\)。
因此,正确答案是 A。
English
The recursion is exactly the tangent addition formula, and \(a_1 = \tan\dfrac{\pi}{4},\) \(a_2 = \tan\dfrac{\pi}{6}.\)
Writing \(a_n = \tan\dfrac{\pi c_n}{12}\) with \(c_1 = 3,\) \(c_2 = 2,\) and \(c_{n+2} \equiv c_n + c_{n+1} \pmod{12},\) the sequence \(c_n\) is \[ \begin{gathered} 3, 2, 5, 7, 0, 7, 7, 2, \\ 9, 11, 8, 7, 3, 10, 1, 11, \\ 0, 11, 11, 10, 9, 7, 4, 11, \ldots \end{gathered} \] which is periodic with period \(24.\)
Since \(2009 = 24\cdot 83 + 17,\) \(c_{2009} = c_{17} = 0,\) so \(a_{2009} = \tan 0 = 0\) and \(|a_{2009}| = 0.\)
Thus, the correct answer is A.