Testwiki:Reference desk/Archives/Mathematics/2018 April 19

{| width = "100%"

|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < April 18 ! width="25%" align="center"|<< Mar | April | May >> ! width="20%" align="right" |Current desk > |}

Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.

April 19

Recurrence Solution

What's the asymptotic solution of the recurrence $T(n)=\sum _{i<n,3\nmid i}T(i)$, with initial condition $T(1)=T(2)=1$? עברית (talk) 10:52, 19 April 2018 (UTC)

Why ask for asymptotic solutions when the exact answer is so simple? It is $T(n)=2^{\lfloor 2n/3\rfloor -1}$ for $n>1$. --JBL (talk) 11:22, 19 April 2018 (UTC)

Tnx :) עברית (talk) 18:25, 19 April 2018 (UTC)