The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A326664 Column 3 of the array at A326661 see Comments. 2
 7, 16, 25, 35, 43, 52, 61, 71, 79, 88, 97, 107, 115, 124, 133, 142, 151, 160, 169, 179, 187, 196, 205, 215, 223, 232, 241, 251, 259, 268, 277, 286, 295, 304, 313, 323, 331, 340, 349, 359, 367, 376, 385, 395, 403, 412, 421, 430, 439, 448, 457, 467, 475, 484 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is the sequence (c(n)) defined by the complementary equation c(n) = a(n) + b(3n), with initial value a(1) = 1. See A326661. Conjecture: 9n-c(n) is in {1,2} for all n. LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 MATHEMATICA mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]); a = b = c = {}; h = 1; k = 3; Do[Do[AppendTo[a,   mex[Flatten[{a, b, c}], Max[Last[a /. {} -> {0}], 1]]];   AppendTo[b, mex[Flatten[{a, b, c}], Max[Last[b /. {} -> {0}], 1]]], {k}];   AppendTo[c, a[[h Length[a]/k]] + Last[b]], {150}]; c (* Peter J. C. Moses, Jul 04 2019 *) CROSSREFS Cf. A326661. Sequence in context: A017245 A052221 A119461 * A028560 A190530 A345071 Adjacent sequences:  A326661 A326662 A326663 * A326665 A326666 A326667 KEYWORD nonn,tabl,easy AUTHOR Clark Kimberling, Jul 16 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 05:18 EDT 2021. Contains 345125 sequences. (Running on oeis4.)