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>
| 1167: | \[F_{1167}\] | 2 × 2333 × 44327329 × 13989786889408090766142164789<29> × 27100744230763476331608468125704435058854674830597<50> × 16498751403080702014421774310289663132998501346937386863473<59> × 2674431488145037438269987843643589427055689797189780936222524303828341214797262103694517612735853<97> |