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>
| 668: | \[F_{668}\] | 3 × 766531 × 821641 × 7162963 × 18104700793<11> × 50187047747<11> × 14167898020159929481<20> × 1966344318693345608565721<25> × 504752765667203736366779801<27> × 103849927693584542320127327909<30> |