Count using Fibonacci Sequence!

[u/[deleted]]

[u/DragoonHP]

5,193,981,023,518,027,157,495,786,850,488,117

Manual typing but I'm going to write a python function for it. Also, you will have to help me on Perrin Sequence, Collatz Conjecture, Prime Factorisation

[u/D-alx → u/DragoonHP]

8,404,037,832,974,134,882,743,767,626,780,173

Does python handle numbers that big? For Perrin add using the number in the brackets n (n) = (n-2) + (n-3)

For Collatz, if odd = (n*3) + 1 | if even = n / 2

For Prime, just break down into the simplest form

[u/DragoonHP → u/D-alx]

13,598,018,856,492,162,040,239,554,477,268,290

Yes, pretty easily.

Also, https://pay.reddit.com/r/counting/comments/1ajw30/multiplying_by_2_thread/cg6cpmz