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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129108 a(0)=1. a(n) is the smallest positive integer such that LCM(a(n-1),a(n)) = n!. 1
1, 1, 2, 3, 8, 15, 144, 35, 1152, 2835, 6400, 6237, 6220800, 1001, 6706022400, 1184625, 17661952, 20138625, 6402373705728000, 19, 2432902008176640000, 4535772564960000, 5601658208256000, 2595200462229375, 1558426126802485248 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

EXAMPLE

LCM(a(5),a(6)) = LCM(15,144) = 720 = 6!.

MAPLE

A129108 := proc(nmax) local a, x, i, n, anext; a :=[1] ; while nops(a) < nmax do n := nops(a) : x := [op(numtheory[divisors](n!))] : for i from 1 to nops(x) do anext := op(i, x) ; if lcm(op(-1, a), anext) = factorial(n) then break ; fi ; od ; a := [op(a), anext] ; od ; a ; end: A129108(25) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 15 2007

CROSSREFS

Sequence in context: A148013 A133983 A005162 * A160622 A153699 A182670

Adjacent sequences:  A129105 A129106 A129107 * A129109 A129110 A129111

KEYWORD

nonn

AUTHOR

Leroy Quet May 24 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 15 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:33 EST 2012. Contains 205694 sequences.