|
Search: id:A008339
|
|
|
| A008339 |
|
a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n). |
|
+0
3
|
|
| 1, 1, 2, 6, 6, 30, 5, 35, 280, 2520, 252, 2772, 231, 3003, 858, 1430, 5720, 97240, 437580, 8314020, 415701, 969969, 176358, 4056234, 2704156, 67603900, 2600150, 70204050, 10029150, 290845350, 9694845, 300540195, 9617286240, 35263382880, 1037158320
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
a(n+1) = Product(A098666(n,k): 1<=k<=n), row-products of triangle A098666. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Sep 20 2004
a(n+1) is divisible by all primes in (n/2, n]; thus lim_{n->infinity} a(n) = infinity. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Dec 13 2006
|
|
FORMULA
|
a(1) = 1, a(n) = a(n-1)*r/s where y is the largest divisor of a(n-1) with r*s = n. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 01 2003
a(1) = 1, a(n+1) = a(n)*n/gcd(a(n),n)^2. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Dec 13 2006
|
|
MAPLE
|
A008339 := proc(n) option remember; if n = 1 then 1 else lcm(A008339(n-1), n-1)/gcd(A008339(n-1), n-1); fi; end;
|
|
MATHEMATICA
|
FoldList[ LCM[ #1, #2 ]/GCD[ #1, #2 ]&, 1, Range[ 30 ] ]
|
|
CROSSREFS
|
Sequence in context: A085087 A072983 A055204 this_sequence A077139 A068629 A070889
Adjacent sequences: A008336 A008337 A008338 this_sequence A008340 A008341 A008342
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Mma Program Aug 15 1997 (Olivier Gerard).
|
|
|
Search completed in 0.002 seconds
|
