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!)
A129090 a(1)=1; a(n) = gcd(a(n-1), n) + lcm(a(n-1), n). 3
1, 3, 6, 14, 71, 427, 434, 1738, 15643, 156431, 156442, 938654, 12202503, 170835043, 2562525646, 20500205170, 348503487891, 2091020927349, 39729397619632, 198646988098164, 1390528916687151, 30591636167117323, 703607631843698430 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MAPLE
a[1]:=1: for n from 2 to 30 do a[n]:=gcd(a[n-1], n)+lcm(a[n-1], n) od: seq(a[n], n=1..27); # Emeric Deutsch, Apr 13 2007
MATHEMATICA
k = 1; Do[Print[k]; k = GCD[k, n] + LCM[k, n], {n, 2, 30}] (* Ryan Propper, Apr 07 2007 *)
nxt[{n_, a_}]:={n+1, GCD[a, n+1]+LCM[a, n+1]}; NestList[nxt, {1, 1}, 30][[All, 2]] (* Harvey P. Dale, Apr 19 2022 *)
CROSSREFS
Cf. A129091.
Sequence in context: A054099 A257320 A318344 * A324222 A058141 A144654
KEYWORD
nonn
AUTHOR
Leroy Quet, Mar 29 2007
EXTENSIONS
More terms from Ryan Propper and Emeric Deutsch, Apr 07 2007
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 August 1 17:30 EDT 2024. Contains 374818 sequences. (Running on oeis4.)