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,2

Comments

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

Links

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

Example

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,...).

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 *)

Crossrefs

Cf. A325417, A325495.

Sequence in context: A078711 A338850 A322423 * A295561 A076423 A075660

Adjacent sequences: A325491 A325492 A325493 * A325495 A325496 A325497

Keyword

nonn,easy

Author

Clark Kimberling, May 05 2019

Status

approved