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>
| 1890: | \[F_{1890}\] | 23 × 5 × 11 × 13 × 17 × 19 × 29 × 31 × 53 × 61 × 71 × 109 × 181 × 211 × 271 × 379 × 421 × 541 × 631 × 811 × 911 × 1009 × 5779 × 17011 × 21211 × 31249 × 38933 × 42391 × 69931 × 85429 × 109441 × 119611 × 139861 × 141961 × 767131 × 912871 × 5721031 × 9761221 × 35239681 × 1258740001 × 8288823481<10> × 1051224514831<13> × 145150780364101<15> × 1114769954367361<16> × 1276249355629921<16> × 1983000765501001<16> × 955921950316735037<18> × 5362483966272446452741<22> × 120570028745492370271501<24> × 15978634268663090859009211<26> × 13816138606123958966887775588183941<35> × 17607732034386387283996309311942469969073145363781<50> |