A304808 - OEIS

%I #4 May 29 2018 20:42:04

%S 1,3,4,5,6,7,8,10,11,12,13,15,16,17,18,19,21,22,23,24,25,26,28,29,30,

%T 31,33,34,35,36,37,38,40,41,42,43,45,46,47,48,49,50,52,53,54,55,56,58,

%U 59,60,61,63,64,65,66,67,68,70,71,72,73,74,76,77,78,79

%N Solution (b(n)) of the complementary equation a(n) = b(2n) + b(3n) ; see Comments.

%C Define complementary sequences a(n) and b(n) recursively:

%C b(n) = least new,

%C a(n) = b(2n) + b(3n),

%C where "least new" means the least positive integer not yet placed.  Empirically, {a(n) - 6*n: n >= 0} = {2,3} and {5*b(n) - 6*n: n >= 0} = {4,5,6,7,8,9}.  See A304799 for a guide to related sequences.

%H Clark Kimberling, <a href="/A304808/b304808.txt">Table of n, a(n) for n = 0..10000</a>

%e b(0) = 1, so that a(0) = 2.  Since a(1) = b(2) + b(3), we must have a(1) >= 7, so that b(1) = 3, b(2) = 4, b(3) = 5, b(4) = 6, and a(1) = 9.

%t mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);

%t h = 2; k = 3; a = {}; b = {1};

%t AppendTo[a, mex[Flatten[{a, b}], 1]];

%t Do[Do[AppendTo[b, mex[Flatten[{a, b}], Last[b]]], {k}];

%t   AppendTo[a, Last[b] + b[[1 + (Length[b] - 1)/k h]]], {500}];

%t Take[a, 200]  (* A304807 *)

%t Take[b, 200]  (* A304808 *)

%t (* _Peter J. C. Moses_, May 14 2008 *)

%Y Cf. A304799, A304807.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, May 28 2018