|
| |
|
|
A325599
|
|
Difference sequence of A325597.
|
|
5
|
|
|
|
1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,4
|
|
|
COMMENTS
|
All the terms of A325599 are in {1,2}, so that A325600 and A325601 are a complementary pair.
|
|
|
LINKS
|
Clark Kimberling, Table of n, a(n) for n = 1..10000
|
|
|
MATHEMATICA
|
mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]); a = {1}; Do[AppendTo[a, mex[Rest[2 a] + Most[a], Last[a] + 1]], {60}]; a (* A325597 *)
c = Complement[Range[Last[a]], a] (* A325598 *)
da = Differences[a] (* A325599 *)
Flatten[Position[da, 1]] (* A325600 *)
Flatten[Position[da, 2]] (* A325601) *)
(* Peter J. C. Moses, May 07 2019 *)
|
|
|
CROSSREFS
|
Cf. A325597.
Sequence in context: A057557 A353364 A328390 * A023520 A103587 A306446
Adjacent sequences: A325596 A325597 A325598 * A325600 A325601 A325602
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
Clark Kimberling, May 11 2019
|
|
|
STATUS
|
approved
|
| |
|
|
