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!)
A129091 a(0)=1; a(n) = gcd(a(n-1), n) + lcm(a(n-1), n). 1
1, 2, 4, 13, 53, 266, 800, 5601, 44809, 403282, 2016412, 22180533, 88722135, 1153387756, 8073714294, 40368571473, 645897143569, 10980251440674, 32940754322028, 625874332118533, 12517486642370661, 12517486642370682 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
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, Apr 02 2007
CROSSREFS
Cf. A129090.
Sequence in context: A030863 A030800 A291341 * A030970 A030842 A191293
KEYWORD
nonn
AUTHOR
Leroy Quet, Mar 29 2007
EXTENSIONS
More terms from Emeric Deutsch, Apr 02 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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)