id:A076607 - OEIS Search Results

Search: id:A076607

Displaying 1-1 of 1 results found.

page 1

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

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; listen)

	OFFSET	`0,2`
	COMMENT	`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) = 427/7 = 42 = a(6), are there more n such that a(n+1)=a(n)?`
	CROSSREFS	`Sequence in context: A011273 A131133 A096569 this_sequence A054229 A052969 A002990` `Adjacent sequences: A076604 A076605 A076606 this_sequence A076608 A076609 A076610`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 21 2002`

page 1

Search completed in 0.002 seconds

Last modified December 6 13:45 EST 2009. Contains 170429 sequences.

AT&T Labs Research