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 A325464 #4 May 02 2019 08:50:01
%S A325464 1,3,4,5,9,11,12,14,15,16,17,19,20,21,23,26,27,29,33,35,36,37,39,41,
%T A325464 44,45,47,48,50,51,53,56,57,59,60,62,63,64,65,68,69,71,73,75,77,80,81,
%U A325464 83,84,86,87,89,91,92,93,95,98,99,101,104,105,107,108,110
%N A325464 a(n) is the least number not 2*a(m) or 3*a(m)-2 for any m < n.
%H A325464 Clark Kimberling, <a href="/A325464/b325464.txt">Table of n, a(n) for n = 1..10000</a>
%e A325464 The sequence necessarily starts with 1. The next 2 terms are determined as follows: because a(1) = 1, the number 2 is disallowed, so that a(2) = 3, whence the numbers 6 and 7 are disallowed, and a(3) = 4. See A325417 for a guide to related sequences.
%t A325464 a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1, Apply[Or,
%t A325464 Map[MemberQ[a, #] &, Select[Flatten[{#/2, (#+2)/3}],
%t A325464 IntegerQ]]] &]], {150}]; a (* A325464 *)
%t A325464 Complement[Range[Last[a]], a] (* A325465 *)
%t A325464 (* _Peter J. C. Moses_, Apr 25 2019 *)
%Y A325464 Cf. A325417, A325465.
%K A325464 nonn,easy
%O A325464 1,2
%A A325464 _Clark Kimberling_, May 01 2019