A325496 Difference sequence of A077477.

1, 4, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 4, 2, 1, 1, 2, 2, 2, 1, 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,4}.

Examples

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

Links

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

Crossrefs

Cf. A325417, A077477.

Programs

Mathematica

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