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 A333309 #4 Apr 09 2020 23:52:58
%S A333309 1,2,3,4,6,8,9,11,12,14,17,19,22,24,27,30,32,35,38,40,43,48,51,53,56,
%T A333309 61,64,66,69,74,77,82,85,87,90,95,98,103,106,108,111,116,119,124,129,
%U A333309 132,137,140,142,145,150,153,158,163,166,171,174,176,179,184
%N A333309 Numbers that are not the sum of two distinct terms of A003622.
%C A333309 Conjecture: the difference sequences of this sequence and its complement consist exclusively of Fibonacci numbers (A000045).
%e A333309 (See A333308.)
%t A333309 w[n_] := Floor[n*GoldenRatio] + n - 1; (* A003622 *)
%t A333309 s[n_] := Table[w[n] + w[k], {k, 1, n - 1}];
%t A333309 t = Table[s[n], {n, 1, 200}]; u = Union[Flatten[t]] (* A333308 *)
%t A333309 v = Complement[Range[Max[u]], u] (* A333309 *)
%Y A333309 Cf. A000045, A003622, A035513, A333308.
%K A333309 nonn,easy
%O A333309 1,2
%A A333309 _Clark Kimberling_, Apr 01 2020