@edensaesthetic I futzed my way through to the answer in Python, much more slowly than I bet I could if I were adequately able to brain today.

@bstacey Shit, did you actually get to the answer? This is actually taking my processor forever, maybe I did actually write something wrong.

@edensaesthetic I got an answer. The time-intensive part was computing the sums of the factors, since I foolishly used a data structure with more memory and lookup-time overhead than I needed.

@edensaesthetic

N = 28798
factors = [2, 7, 11, 14, 17, 22, 34, 77, 119, 121, 154, 187, 238, 242, 374, 847, 1309, 1694, 2057, 2618, 4114, 14399]
fibonacci = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309] (et cetera)
primes_in_fibonacci = [2, 3, 5, 13, 89, 233, 1597, 28657, 514229]

The factors sum to 28657.

@bstacey (Was using a factor definition that has 1 and n in it, eep) Nice solve :)

@edensaesthetic Yeah, the way the question was phrased, I wasn't sure whether to include those or not, so I tried it without first, and I got an answer and declared myself satisfied.

Sometimes I wonder why I'm paid to use a computer for work, clearly I am not the right person to be trusted

@edensaesthetic hey dont feel bad i get paid to yell at people on twitter