This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A330821 #48 Mar 09 2020 15:32:53
%S A330821 1,2,3,5,15,51,305,1059,4083,117737,3775459,19465955,952896293,
%T A330821 13613071346,14565967639,112716155924,11073544747197,637616871476643,
%U A330821 11027737075804991,3056322734187753262,542921033413649799807,8189660342217563295915,515222301162241572644117
%N A330821 a(1) = 1, a(2) = 2. Thereafter a(n+1) is the smallest number k such that A001414(k) = a(n) + a(n-1).
%H A330821 Jinyuan Wang, <a href="/A330821/b330821.txt">Table of n, a(n) for n = 1..200</a>
%F A330821 a(n+1) = A056240(a(n) + a(n-1)).
%e A330821 sopfr(3) = 3 = 2 + 1, sopfr(15) = 8 = 3 + 5, etc.
%t A330821 s[1] = 0; s[n_] := Plus @@ Times @@@ FactorInteger@n; a[1] = 1; a[2] = 2; a[n_] := a[n] = Module[{k = 1, sum = a[n - 1] + a[n - 2]}, While[s[k] != sum, k++]; k]; Array[a, 10] (* _Amiram Eldar_, Jan 02 2020 *)
%Y A330821 Cf. A000045, A001414, A056240.
%K A330821 nonn
%O A330821 1,2
%A A330821 _David James Sycamore_, Jan 02 2020
%E A330821 Data corrected by and more terms from _Amiram Eldar_ and _David A. Corneth_, Jan 02 2020
%E A330821 Data corrected by _Jinyuan Wang_, Mar 08 2020