|
Search: id:A094299
|
|
|
| A094299 |
|
a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n. |
|
+0
3
|
|
| 1, 1, 2, 6, 3, 15, 5, 35, 280, 2520, 252, 2772, 231, 3003, 429, 143, 2288, 38896, 19448, 369512, 92378, 1939938, 88179, 2028117, 676039, 16900975, 1300075, 35102025, 5014575, 145422675, 9694845, 300540195, 9617286240, 3205762080, 94287120
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
a(5) = 15 hence a(6) = least integer multiple of 15/6 = 5.
|
|
PROGRAM
|
(PARI) a=1; for(n=2, 35, print1(a, ", "); d=gcd(a, n); a=if(d==1, a*n, a/d))
|
|
CROSSREFS
|
Cf. A055773.
Sequence in context: A055773 A111866 A072155 this_sequence A121566 A056839 A071301
Adjacent sequences: A094296 A094297 A094298 this_sequence A094300 A094301 A094302
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 29 2004
|
|
EXTENSIONS
|
Terms a(14) to a(34) and PARI code from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 29 2004
Extended to include a(0) by N. J. A. Sloane (njas(AT)research.att.com), Dec 23 2007
|
|
|
Search completed in 0.002 seconds
|
