Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275664 a(n) is the sum of the LCM and GCD of all previous terms, with a(0) = 2. 2
2, 4, 6, 14, 86, 3614, 6526886, 21300113901614, 226847426110843688722000886, 25729877366557343481074291996721923093306518970391614 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Starting from 1, instead of from 2, it is generated A129871 (A variant of Sylvester's sequence A000058).
LINKS
FORMULA
a(0) = 2, a(n+1) = lcm(a(0),a(1),..,a(n)) + gcd(a(0),a(1),..,a(n)).
MATHEMATICA
a = {2}; Do[AppendTo[a, LCM @@ a + GCD @@ a], {i, 1, 10}]; Column[a]
CROSSREFS
Sequence in context: A077637 A077639 A039791 * A349979 A192536 A227902
KEYWORD
nonn
AUTHOR
Andres Cicuttin, Aug 04 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 11 14:25 EDT 2024. Contains 375836 sequences. (Running on oeis4.)