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>
| 1791: | \[F_{1791}\] | 2 × 17 × 397 × 1193 × 55092353 × 4897253089<10> × 147290305388813<15> × 1226244816494972899766403949<28> × 436782169201002048261171378550055269633<39> × 932699779426192039767669517873373284542762481<45> × 241215750038856263159716121686098664477752682525771365953523520412080494368158775294634138935517800635218113117<111> × 1148844274603906293890529267369286595873870345990523419368092555061370174996362324477929708660691592098869471164329<115> |