|
Search: id:A129091
|
|
|
| A129091 |
|
a(0)=1. a(n) = GCD(a(n-1),n) + LCM(a(n-1),n). |
|
+0
2
|
|
| 1, 2, 4, 13, 53, 266, 800, 5601, 44809, 403282, 2016412, 22180533, 88722135, 1153387756, 8073714294, 40368571473, 645897143569, 10980251440674, 32940754322028, 625874332118533, 12517486642370661, 12517486642370682
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MAPLE
|
a[0]:=1: for n from 1 to 25 do a[n]:=gcd(a[n-1], n)+lcm(a[n-1], n) od: seq(a[n], n=0..25); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 02 2007
|
|
CROSSREFS
|
Cf. A129090.
Sequence in context: A030917 A030863 A030800 this_sequence A030970 A030842 A151802
Adjacent sequences: A129088 A129089 A129090 this_sequence A129092 A129093 A129094
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Mar 29 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 02 2007
|
|
|
Search completed in 0.002 seconds
|
