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!)
 A333309 Numbers that are not the sum of two distinct terms of A003622. 2
 1, 2, 3, 4, 6, 8, 9, 11, 12, 14, 17, 19, 22, 24, 27, 30, 32, 35, 38, 40, 43, 48, 51, 53, 56, 61, 64, 66, 69, 74, 77, 82, 85, 87, 90, 95, 98, 103, 106, 108, 111, 116, 119, 124, 129, 132, 137, 140, 142, 145, 150, 153, 158, 163, 166, 171, 174, 176, 179, 184 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjecture: the difference sequences of this sequence and its complement consist exclusively of Fibonacci numbers (A000045). LINKS EXAMPLE (See A333308.) MATHEMATICA w[n_] := Floor[n*GoldenRatio] + n - 1; (* A003622 *) s[n_] := Table[w[n] + w[k], {k, 1, n - 1}]; t = Table[s[n], {n, 1, 200}]; u = Union[Flatten[t]]  (* A333308 *) v = Complement[Range[Max[u]], u]  (* A333309 *) CROSSREFS Cf. A000045, A003622, A035513, A333308. Sequence in context: A186541 A207432 A020900 * A282697 A002479 A010458 Adjacent sequences:  A333306 A333307 A333308 * A333310 A333311 A333312 KEYWORD nonn,easy AUTHOR Clark Kimberling, Apr 01 2020 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 May 7 17:52 EDT 2021. Contains 343652 sequences. (Running on oeis4.)