The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069260 a(n) = core(1)*core(2)*...*core(n) where core(n) is the squarefree part of n (A007913). 1
1, 2, 6, 6, 30, 180, 1260, 2520, 2520, 25200, 277200, 831600, 10810800, 151351200, 2270268000, 2270268000, 38594556000, 77189112000, 1466593128000, 7332965640000, 153992278440000, 3387830125680000, 77920092890640000, 467520557343840000, 467520557343840000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A "core" analog of n! (A000142) - might be called a "c-factorial" (see formula). - Vladimir Shevelev, Oct 22 2014
LINKS
FORMULA
Let p_n = prime(n). a(n) = n!^(c) = p_1^b_1*p_2^b_2*...*p_k^b_k, where p_k is maximal prime <= n and b_i = floor(n/p_i)- floor(n/p_i^2) + floor(n/p_i^3)-..., i.e., for exponents of primes of c-factorial we have an alternating sum, instead of the similar sum for exponents of primes for n! - Vladimir Shevelev, Oct 22 2014
MATHEMATICA
core[n_] := Times @@ (First[#]^Mod[Last[#], 2] & /@ FactorInteger[n]); FoldList[Times, 1, core /@ Range[2, 23]] (* Amiram Eldar, Sep 05 2020 *)
PROG
(PARI) a(n) = prod(i=1, n, core(i)); \\ Michel Marcus, Aug 09 2013
CROSSREFS
Sequence in context: A061558 A123144 A179215 * A056603 A019198 A155164
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Apr 14 2002
EXTENSIONS
More terms from Amiram Eldar, Sep 05 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 01:34 EDT 2024. Contains 373102 sequences. (Running on oeis4.)