login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
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; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..34.

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 A121566 A056839

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 16 06:59 EST 2019. Contains 319188 sequences. (Running on oeis4.)