Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 May 07 2019 21:29:45
%S 2,1,2,3,1,2,1,1,1,1,2,2,1,1,2,4,2,2,1,1,2,1,3,2,3,1,2,1,1,1,1,2,2,1,
%T 1,2,1,3,2,2,1,1,2,2,1,1,1,1,2,1,1,2,1,1,1,1,2,2,1,1,2,4,2,2,1,1,2,1,
%U 3,2,2,1,1,2,2,1,1,2,2,1,1,2,1,3,2,2
%N Difference sequence of A325440.
%C See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4}.
%H Clark Kimberling, <a href="/A325530/b325530.txt">Table of n, a(n) for n = 1..10000</a>
%t a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1, Apply[Or,
%t Map[MemberQ[a, #] &, Select[Flatten[{(#+1)/2, (#+1)/3}],
%t IntegerQ]]] &]], {20000}]; a; (* A315440 *)
%t c = Complement[Range[Last[a]], a] ; (* A325441 *)
%t Differences[a] (* A325530 *)
%t Differences[c] (* A325531 *)
%t (* _Peter J. C. Moses_, Apr 23 2019 *)
%Y Cf. A325417, A325440, A325531.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, May 07 2019