|
%I #6 May 06 2019 08:48:08
%S 1,1,2,6,4,2,2,2,2,3,1,2,2,1,3,4,2,2,1,3,4,2,6,4,2,4,2,4,2,2,1,3,4,2,
%T 4,2,4,2,2,1,3,4,2,2,1,1,2,4,2,2,4,4,2,2,1,3,4,2,2,1,3,4,2,4,2,3,1,2,
%U 2,1,3,4,2,2,1,3,4,2,2,4,3,1,2,4,2,4
%N Difference sequence of A325422.
%C See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4,6}.
%H Clark Kimberling, <a href="/A325497/b325497.txt">Table of n, a(n) for n = 1..10000</a>
%e A325422 is given by A(n) = least number not 2*A(m)+1 or 3*A(m)+1 for any m < n, so that A = (3,4,5,7,13,17,19,...), with differences (1,1,2,6,4,2,...).
%t a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
%t Apply[Or, Map[MemberQ[a, #] &, Select[Flatten[{(#-1)/3, (# - 1)/2}],
%t IntegerQ]]] &]], {2000}]; a ; (* A077477 *)
%t c = Complement[Range[Last[a]], a] ; (* A325422 *)
%t Differences[a] (* A325496 *)
%t Differences[c] (* A325497 *)
%t (* _Peter J. C. Moses_, Apr 23 2019 *)
%Y Cf. A325417, A325422.
%K nonn,easy
%O 1,3
%A _Clark Kimberling_, May 05 2019
|
