A325494 Difference sequence of A325419.

1, 2, 3, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 3, 1, 2, 3, 1, 2, 1, 1, 2, 2, 3, 1, 2, 1, 2, 1, 2, 3, 1, 2, 1, 2, 1, 2, 3, 1, 2, 2, 2, 2, 3, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 3, 1, 2, 3, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 1, 1, 2, 2, 3

Offset: 1

Author

Clark Kimberling, May 05 2019

Keywords

• nonn
• easy

Comments

See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3}.

Examples

			A325419 is given by A(n) = least number not 3*A(m) or 2*A(m)+1 for any m < n, so that A = (1,2,4,7,8,10,11,...), with differences (1,2,3,1,2,1,...).
		

Links

• Clark Kimberling, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A325417, A325495.

Programs

Mathematica

a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
Apply[Or, Map[MemberQ[a, #] &, Select[Flatten[{#/3, (# - 1)/2}],
IntegerQ]]] &]], {2000}]; a ;       (* A325419 *)
c = Complement[Range[Last[a]], a] ; (* A325420 *)
Differences[a]  (* A325494 *)
Differences[c]  (* A325495 *)
(* Peter J. C. Moses, Apr 23 2019 *)