|
Search: id:A048803
|
|
|
| A048803 |
|
a(0) = 1, a(1) = 1; for n > 1, a(n) = l.c.m { 1, 2, ..., n, a(1)*a(n-1), a(2)*a(n-2), ..., a(n-1)*a(1) }. |
|
+0
4
|
|
| 1, 1, 2, 6, 12, 60, 360, 2520, 5040, 15120, 151200, 1663200, 9979200, 129729600, 1816214400, 27243216000, 54486432000, 926269344000, 5557616064000, 105594705216000, 1055947052160000, 22174888095360000, 487847538097920000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Squarefree factorials: a(1) = 1, a(n+1) = a(n)* largest squarefree divisor of (n+1). - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 28 2004
|
|
REFERENCES
|
Paul-Jean Cahen and Jean-Luc Chabert, Integer-valued Polynomials, AMS, Providence, RI, 1997. Math. Rev. 98a:13002. See p. 246.
|
|
LINKS
|
Index entries for sequences related to lcm's
|
|
FORMULA
|
Partial products of A007947.
|
|
PROGRAM
|
(PARI) a(n)=local(f); f=n>=0; if(n>1, forprime(p=2, n, f*=p^(n\p))); f
|
|
CROSSREFS
|
Sequence in context: A072487 A072938 A160274 this_sequence A068625 A162935 A051451
Adjacent sequences: A048800 A048801 A048802 this_sequence A048804 A048805 A048806
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Apr 15 1999.
|
|
EXTENSIONS
|
Entry improved by comments from Michael Somos, Nov 24, 2001
|
|
|
Search completed in 0.002 seconds
|
