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!)
 A275698 a(0) = 2, after that a(n) is 3 plus the least common multiple of previous terms. 1
 2, 5, 13, 133, 17293, 298995973, 89398590973228813, 7992108067998667938125889533702533, 63873791370569400659097694858350356285036046451665934814399129508493 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS This sequence could be considered a particular case of a possible two-parameter family of sequences of the form: a(n) = k1 + lcm(a(0),a(1),..,a(n-1)), a(0) = k2, where in this case k1=3 and k2=2. With other choices of k1 and k2 it seems it is possible to generate other sequences such as A129871 with k1 = 1 and k2 = 1, A000058 with k1 = 1 and k2 = 2, A082732 with k1 = 1 and k2 = 3, A000215 with k1 = 2 and k2 = 3, A000324 with k1 = 4 and k2 = 1, A001543 with k1 = 5 and k2 = 1, A001544 with k1 = 6 and k2 = 1, A275664 with k1 = 2 and k2 = 2, A000289 with k1 = 3 and k2 = 1. LINKS S. W. Golomb, On certain nonlinear recurring sequences, Amer. Math. Monthly 70 (1963), 403-405. S. Mustonen, On integer sequences with mutual k-residues Seppo Mustonen, On integer sequences with mutual k-residues [Local copy] FORMULA a(n) = 3 + lcm(a(0), a(1), ..., a(n - 1)), a(0) = 2. MATHEMATICA A275698 = {2}; Do[AppendTo[A275698, 3 + LCM@@A275698], {i, 9}]; A275698 CROSSREFS Cf. A000058, A000215, A000289, A000324, A001543, A001544, A082732, A275664. Sequence in context: A120266 A230518 A241248 * A186450 A065797 A196273 Adjacent sequences:  A275695 A275696 A275697 * A275699 A275700 A275701 KEYWORD nonn AUTHOR Andres Cicuttin, Aug 05 2016 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 August 3 19:54 EDT 2021. Contains 346441 sequences. (Running on oeis4.)