%I #7 May 06 2019 21:22:59
%S 3,1,5,1,2,1,5,3,1,2,1,2,3,1,5,3,1,3,2,3,1,2,1,2,3,1,5,1,2,1,3,2,3,1,
%T 5,3,1,5,1,2,1,5,3,1,2,3,3,1,5,1,2,1,3,2,3,1,2,1,2,3,1,5,1,2,1,3,2,3,
%U 1,3,2,3,1,5,1,2,1,5,3,1,2,3,3,1,5,3
%N Difference sequence of A325430.
%C See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,5}.
%H Clark Kimberling, <a href="/A325523/b325523.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[{#/3,
%t If[Mod[#, 3] == 0, (2 #)/3, 0] + If[Mod[#, 3] == 1, 1/3 (1 + 2 #), 0]}],
%t IntegerQ || # == 0]]] &]], {20000}]; a ; (* A325429 *)
%t c = Complement[Range[Last[a]], a] ; (* A325430 *)
%t Differences[a] (* A325522 *)
%t Differences[c] (* A325523 *)
%t (* _Peter J. C. Moses_, Apr 23 2019 *)
%Y Cf. A325417, A325430, A325522.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, May 06 2019