“Regarding Fibonacci: check out 15.jpg .  Consider, if you will, the mathematical set of all prime numbers. This can be represented as {2,3,5,7...} . Now pick any prime number in that set. Call its position in the set its ‘order’. Set 2 as order 0, such that 3 is order 1, 5 is order 2, etc. This (P)rime order terminology can be written as Pn, where ‘n’ is the order of a particular prime. So, 2 is written as P0, 3 is P1, and 5 is P2. With me so far? Now, think of the number 3301 and consider the table of numbers on 15.jpg , which I’ve attached to this message. While keeping 3301 in mind,   Look at the number 3299 in the table. Notice anything? It is both the only red number and the only prime number of the table. It is also 2 less than 3301. We will now be labeling the numbers of this table according to their difference from 3301, in the ‘Pn’ prime order notation discussed previously.”

“So, to finally start, label the glaring red starting point of 3299 as P0, since 3301-3299=2 and 2 = P0. Got it? Now move your attention rightward one item in the table, from 3299 to 3298. Applying the same treatment as before, 3298 shall be labeled as P1, since 3301-3298 = 3, and 3 =P1. So now we have P0 in the place of 3299 and P1 in place of 3298. Move one item down from 3298 to 3296. Same treatment and 3296 becomes P2. Continue this process along the spiral I drew in the attached copy of 15.jpg, which is the raw table entries’ path of decreasing numerical value, and you end up with a Prime Order table that represents a recursive pseudofibonacci function of the form {0, 1 , 2, 3, 5, 8 , 13, 21, 34, 55, 89, 144, 233, 377...} . The last two raw entries of the original 15.jpg table, 1206 and 4516 are anomalous. To properly convert them to prime order values in this manner and continue the Fibonacci sequence, one must switch from calculating by the format (3301-x=?) to (3301 + x=?) before computing the prime order of the resultant value. Doing this extends perfectly the recursive pseudofibonacci sequence by the terms{...610, 987}. It is, imo very likely that the methodology switchup for the final two terms implies an oscillatory/cyclical nature of the function in the manner of the Möbius strip depicted directly below the table.”

Random thought: what if the first ten entries of the 15.jpg  converted pseudofibonacci prime order table represent the order in which the pages of the LP must be solved, starting with 0.jpg (represented by the red number 3299) and ending with 55.jpg. 56.jpg and 57.jpg are the two already solved pages. {0, 1, 2, 3, 5, 8, 13, 21, 34, 55} Possibly related to 0.jpg anomaly?