|
Search: id:A102068
|
|
|
| A102068 |
|
P(n)!, where P(n) is the largest prime factor of n (with a(1) = 1). |
|
+0
5
|
|
| 1, 2, 6, 2, 120, 6, 5040, 2, 6, 120, 39916800, 6, 6227020800, 5040, 120, 2, 355687428096000, 6, 121645100408832000, 120, 5040, 39916800, 25852016738884976640000, 6, 120, 6227020800, 6, 5040
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
P(n)! is a multiple of n, for almost all n. The exceptions are A057109.
|
|
REFERENCES
|
I. Kastanas, The smallest factorial that is a multiple of n, Amer. Math. Monthly 101 (1994) 179.
|
|
LINKS
|
A. Ivic, On a problem of Erdos involving the largest prime factor of n
Eric Weisstein's World of Mathematics, GreatestPrimeFactor
Index entries for sequences related to factorial numbers.
|
|
FORMULA
|
a(n) = A000142(A006530(n)) = A000040(A061395(n))!.
|
|
EXAMPLE
|
P(12)! = 3! = 6.
|
|
CROSSREFS
|
Cf. A000040, A000142, A006530, A057109, A061395, A102067.
Sequence in context: A122018 A005729 A086660 this_sequence A104290 A136759 A056129
Adjacent sequences: A102065 A102066 A102067 this_sequence A102069 A102070 A102071
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Dec 28 2004
|
|
|
Search completed in 0.004 seconds
|
