login
This site is supported by donations to The OEIS Foundation.
Logo

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. 0
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, 75232917396, 75232917425, 451397504550 (list; graph; refs; listen; history; 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)?

CROSSREFS

Sequence in context: A184296 A131133 A096569 * A054229 A052969 A002990

Adjacent sequences:  A076604 A076605 A076606 * A076608 A076609 A076610

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 21 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:01 EST 2012. Contains 205667 sequences.