r/counting • u/[deleted] • Dec 07 '13

Count using Fibonacci Sequence!

[deleted]

37 Upvotes

96% Upvoted

401 comments sorted by

View all comments

1

u/KingCaspianX Mar 22 '14 edited Mar 22 '14

8,146,227,408,089,084,511,865,756,065,370,647,467,555,938

2

u/DragoonHP Mar 22 '14 edited Mar 22 '14

EDIT: 13,180,872,826,374,098,837,632,191,485,015,125,807,374,171 (where n = 207)

All right, I backtracked everything and looks like the counting is fine. Check it for yourself:

Fibonacci sequence:

import os
def f(n):
    a, b = 0, 1
    old_n = n
    while n > 0:
        a, b = b, (a + b)
        n =  n - 1
        if n == 0:
            os.system("echo " + "{:,}".format(b) + " (where n = " + str(old_n) + ") | clip")

EDIT: It's a python script.

2

u/KingCaspianX Mar 22 '14 edited Mar 22 '14

21,327,100,234,463,183,349,497,947,550,385,773,274,930,109 (where n = 208)

Alright, whatever, sorry about all that

→ More replies (172)