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 A325444 #12 Feb 22 2020 20:57:36
%S A325444 2,2,2,1,1,2,1,1,2,2,2,1,1,2,4,2,2,1,1,2,1,3,2,2,1,1,2,1,1,1,1,2,2,1,
%T A325444 1,2,1,3,2,2,1,1,2,2,1,1,1,1,2,1,1,2,1,1,2,2,2,1,1,2,4,2,2,1,1,2,1,3,
%U A325444 2,2,1,1,2,2,1,1,2,2,1,1,2,1,3,2,2,1
%N A325444 Difference sequence of A325417.
%C A325444 See A325417 for a guide to related sequences. Conjecture: all the differences are in {1,2,3,4}; a count of differences d(n) = a(n)-a(n-1) for n=2..10000 follows: 4755 occurrences of d(n) = 1; 4332 of 2; 744 of 3; and 169 of 4.
%H A325444 Clark Kimberling, <a href="/A325444/b325444.txt">Table of n, a(n) for n = 1..10000</a>
%e A325444 A325417 is given by A(n) = least number not 2*A(m) or 3*A(m)+1 for any m < n, so that A = (1,3,5,7,8,9,11, ...), with differences (2,2,2,1,1,2,...).
%t A325444 a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
%t A325444 Apply[Or, Map[MemberQ[a, #] &, Select[Flatten[{#/2, (# - 1)/3}],
%t A325444 IntegerQ]]] &]], {2000}]; a ; (* A325417 *)
%t A325444 c = Complement[Range[Last[a]], a] ; (* A325418 *)
%t A325444 Differences[a] (* A325444 *)
%t A325444 Differences[c] (* A325445 *)
%t A325444 (* _Peter J. C. Moses_, Apr 23 2019 *)
%Y A325444 Cf. A325417, A325445.
%K A325444 nonn,easy
%O A325444 1,1
%A A325444 _Clark Kimberling_, May 03 2019