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.

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

Offset

0,3

Links

Scott R. Shannon, Table of n, a(n) for n = 0..1000

Example

a(5) = 15 hence a(6) = least integer multiple of 15/6 = 5.

Prog

(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: A111866 A251753 A072155 * A304537 A330252 A368823

Adjacent sequences: A094296 A094297 A094298 * A094300 A094301 A094302

Keyword

nonn,easy

Author

Amarnath Murthy, Apr 29 2004

Extensions

Terms a(14) to a(34) and PARI code from Klaus Brockhaus, Apr 29 2004

Extended to include a(0) by N. J. A. Sloane, Dec 23 2007

Status

approved