login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A325496
Difference sequence of A077477.
3
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,2
COMMENTS
See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4}.
LINKS
EXAMPLE
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,...).
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 *)
CROSSREFS
Sequence in context: A377366 A016508 A351986 * A010312 A303599 A068930
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 05 2019
STATUS
approved