|
%I #4 Apr 18 2018 19:49:38
%S 3,16,27,43,60,79,100,126,153,182,213,249,289,330,373,418,465,514,565,
%T 624,683,744,807,872,939,1008,1082,1157,1234,1313,1394,1477,1562,1652,
%U 1746,1841,1938,2037,2138,2241,2346,2453,2562,2673,2786,2904,3023,3147
%N Solution (c(n)) of the system of 3 complementary equations in Comments.
%C Define sequences a(n), b(n), c(n) recursively, starting with a(0) = 1, b(0) = 2:
%C a(n) = least new;
%C b(n) = least new k >= a(n) + b(n-1);
%C c(n) = a(n) + 2 b(n);
%C where "least new k" means the least positive integer not yet placed. The sequences a,b,c partition the positive integers.
%H Clark Kimberling, <a href="/A298873/b298873.txt">Table of n, a(n) for n = 0..1000</a>
%e n: 0 1 2 3 4 5 6 7 8 9
%e a: 1 4 5 7 8 9 10 12 13 14
%e b: 2 6 11 18 26 35 45 57 70 84
%e c: 3 16 27 43 60 30 79 100 126 153
%t z = 400;
%t mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
%t a = {1}; b = {2}; c = {3};
%t Do[{AppendTo[a, mex[Flatten[{a, b, c}], 1]],
%t AppendTo[b, mex[Flatten[{a, b, c}], Last[a] + Last[b]]],
%t AppendTo[c, Last[a] + 2 Last[b]]}, {z}];
%t Take[a, 100] (* A298871 *)
%t Take[b, 100] (* A298872 *)
%t Take[c, 100] (* A298873 *)
%Y Cf. A299634, A298871, A298872, A298874.
%K nonn,easy
%O 0,1
%A _Clark Kimberling_, Apr 18 2018
|
