Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 May 06 2019 21:23:54
%S 2,2,3,1,2,3,1,2,2,1,3,1,2,1,2,2,1,1,2,2,4,1,2,1,2,3,1,2,3,1,2,1,5,3,
%T 1,2,1,1,4,1,2,1,2,3,1,2,2,1,1,2,1,2,1,2,3,1,2,3,1,2,3,3,3,1,2,1,1,1,
%U 3,1,2,1,2,3,1,2,2,4,1,2,1,2,3,1,2,2
%N Difference sequence of A325425.
%C See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4,5,6}.
%H Clark Kimberling, <a href="/A325518/b325518.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[{#/2,
%t If[Mod[#, 3] == 0, (2 #)/3, 0] + If[Mod[#, 3] == 1, 1/3 (1 + 2 #), 0]}],
%t IntegerQ || # == 0]]] &]], {200}]; a ; (* A325425 *)
%t c = Complement[Range[Last[a]], a] ; (* A325426 *)
%t Differences[a] (* A325518 *)
%t Differences[c] (* A325519 *)
%t (* _Peter J. C. Moses_, Apr 23 2019 *)
%Y Cf. A325417, A325425, A325519.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, May 06 2019