Could you elaborate on your reasons for calling Eric Weisstein insane?

I assume you're referring to Stephen Wolfram, not Neil Sloane, but it seems many people would like clarification.

As to Wolfram, assuming this is your focus, nothing undermines one's sanity as reliably as complete success. Not to accept your premise, only to explain it.

By the way, the use of `filter` makes your implementation unnecessarily slow. (The posted link also contains Haskell code, which uses `delete` from Data.List instead of `filter`, which is only slightly better.)

I'd solve it like this, which generates both sequences in O(n) time, and the mutual recursion is cute:

    a005228 = 1 : zipWith (+) a005228 a030124

    a030124 = go 1 a005228 where
        go x ys
            | x < head ys = x     : go (x + 1) ys
            | otherwise   = x + 1 : go (x + 2) (tail ys)