The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076607 a(0)=1 and for n>0: a(n) = if gcd(a(n-1),n)>1 then lcm(a(n-1),n) else a(n-1)+n. 1
 1, 2, 2, 5, 9, 14, 42, 42, 168, 504, 2520, 2531, 2543, 2556, 17892, 89460, 357840, 357857, 357875, 357894, 3578940, 25052580, 275578380, 275578403, 275578427, 275578452, 3582519876, 10747559628, 75232917396, 75232917425, 451397504550 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS As gcd(a(7-1),7) = gcd(42,7) = 7, a(7) = lcm(a(7-1),7) = a(6)*7/gcd(a(7-1),7) = 42*7/7 = 42 = a(6), are there more n such that a(n+1)=a(n)? LINKS Robert Israel, Table of n, a(n) for n = 0..1145 MAPLE A[0]:= 1: for n from 1 to 100 do   if igcd(A[n-1], n) > 1 then A[n]:= ilcm(A[n-1], n)   else A[n]:= A[n-1]+n   fi od: seq(A[i], i=0..100); # Robert Israel, Apr 18 2019 CROSSREFS Sequence in context: A184296 A131133 A096569 * A325104 A054229 A212812 Adjacent sequences:  A076604 A076605 A076606 * A076608 A076609 A076610 KEYWORD nonn AUTHOR Reinhard Zumkeller, Oct 21 2002 EXTENSIONS Corrected by Robert Israel, Apr 18 2019 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 December 8 01:00 EST 2021. Contains 349590 sequences. (Running on oeis4.)