Fibonacci Sequence
Defined with \(F_0=0\), \(F_1=1\), and \(F_n=F_{n-1}+F_{n-2}\) when \(n\geq2\).
Table
Format: small prime × proven prime<size> × (probable prime)<size> × [composite]<size> × {unknown}<size>
| 1473: | \[F_{1473}\] | 2 × 8837 × 67757 × 3057949 × 141600090215093<15> × 1621212105820049<16> × 36109294700391377<17> × 272369735996558694790986998993<30> × 76327227386038791284321506930848070152247756399364803009077679734113<68> × 7989930331870878172694349568563967453474817377713504694454418890569410437<73> × 6119079919895770936675008021082942484908942862815591360616697629525990793677<76> |