A325522 Difference sequence of A325429.

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

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

Mathematica

a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1, Apply[Or,
Map[MemberQ[a, #] &, Select[Flatten[{#/3,
If[Mod[#, 3] == 0, (2 #)/3, 0] + If[Mod[#, 3] == 1, 1/3 (1 + 2 #), 0]}],
IntegerQ || # == 0]]] &]], {20000}]; a ;   (* A325429 *)
c = Complement[Range[Last[a]], a] ;        (* A325430 *)
Differences[a]  (* A325522 *)
Differences[c]  (* A325523 *)
(* Peter J. C. Moses, Apr 23 2019 *)

Crossrefs

Cf. A325417, A325429, A325523.

Sequence in context: A110969 A362681 A320077 * A006083 A338713 A080301

Adjacent sequences: A325519 A325520 A325521 * A325523 A325524 A325525

Keyword

nonn,easy

Author

Clark Kimberling, May 06 2019

Status

approved