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 A345471 #14 Jul 13 2021 16:33:32
%S A345471 1,1,2,3,5,11,17,29,47,79,127,211,343,557,907,1469,2377,3847,6229,
%T A345471 10079,16319,26399,42719,69119,111841,180967,292811,473779,766607,
%U A345471 1240387,2006999,3247393,5254397,8501791,13756189,22258001,36014191,58272197,94286389,152558587
%N A345471 a(0) = a(1) = 1, a(n) is the smallest positive integer m >= a(n-1) + a(n-2) such that gcd(a(k),m) = 1 for all 1 < k <= n - 1.
%C A345471 First differs from A073021 at a(12).
%e A345471 a(5) = 11 because 11 is the smallest number greater than or equal to a(3) + a(4) = 5 + 3 = 8 which is coprime to all previous terms of the sequence.
%t A345471 a[0] = a[1] = 1; a[n_] := a[n] = Module[{k = a[n - 1] + a[n - 2]}, While[! AllTrue[Range[2, n - 1], CoprimeQ[a[#], k] &], k++]; k]; Array[a, 40, 0] (* _Amiram Eldar_, Jun 20 2021 *)
%Y A345471 Cf. A073021, A345020.
%K A345471 nonn
%O A345471 0,3
%A A345471 _Amrit Awasthi_, Jun 20 2021