|
Search: id:A162842
|
|
|
| A162842 |
|
a(1)=1,a(2)=2, then a(n) is the smallest m not yet appeared and not divisible by any pair-wise sum of a(1)..a(n-1). |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Strictly increasing sequence.
|
|
EXAMPLE
|
a(1)=1,a(2)=2,a(3)=4, pair-wise 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
|
|
PROGRAM
|
(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: A002152 A163522 A002466 this_sequence A164901 A109853 A127977
Adjacent sequences: A162839 A162840 A162841 this_sequence A162843 A162844 A162845
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Jul 14 2009
|
|
EXTENSIONS
|
Terms corrected and PARI code added by M. F. Hasler (mhasler(AT)univ-ag.fr), Aug 30 2009
|
|
|
Search completed in 0.002 seconds
|
