This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A162842 a(1)=1,a(2)=2, then a(n) is the smallest m not yet appeared and not divisible by any pairwise sum of a(1)..a(n-1). 0
 1, 2, 4, 7, 13, 19, 29, 37, 43, 49, 58, 61, 67, 73, 79, 89, 97, 103, 109, 127, 133, 139, 149, 157, 163, 169, 179, 193, 199, 211, 223, 229, 239, 247, 259, 271, 277, 283, 293, 298, 301, 307, 313, 331, 337, 343, 349, 358, 361, 367, 373, 379, 397, 409, 421, 427, 433 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Strictly increasing sequence. LINKS EXAMPLE a(1)=1,a(2)=2,a(3)=4, pairwise sums=pws={3,5,6}; smallest m not yet appeared and not divisible by any of pws is m=7 hence a(4)=7; now pws={3,5,6,8,9,11}; hence a(5)=13, etc. MATHEMATICA s={1, 2}; ps={3}; a=2; Do[Do[If[Mod[n, ps[[i]]]==0, Goto[ne]], {i, Length[ps]}]; a=n; ps=Union[Flatten[{ps, s+a}]]; AppendTo[s, a]; Label[ne], {n, 3, 1000}]; s PROG (PARI) {S=[]; for(n=1, 999, for(i=2, #S, for(j=1, i-1, n%(S[i]+S[j]) | next(3))); S=concat(S, n); print1(n", "))} \\ M. F. Hasler, Aug 30 2009 CROSSREFS Cf. A164901. Sequence in context: A163522 A255173 A002466 * A164901 A109853 A262744 Adjacent sequences:  A162839 A162840 A162841 * A162843 A162844 A162845 KEYWORD nonn AUTHOR Zak Seidov, Jul 14 2009 EXTENSIONS Terms corrected and PARI code added by M. F. Hasler, Aug 30 2009 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.