|
| |
|
|
A007947
|
|
Largest squarefree number dividing n (the squarefree kernel of n).
|
|
274
| |
|
|
1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 30, 61, 62, 21, 2, 65, 66, 67, 34, 69, 70, 71, 6, 73, 74, 15, 38, 77, 78
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Sometimes called rad(n).
Multiplicative with a(p^e) = p.
For n>1, product of the distinct prime factors of n.
a(k)=k for k=squarefree numbers A005117. - Lekraj Beedassy, Sep 05 2006
A note on square roots of numbers: we can write sqrt(n) = b*sqrt(c) where c is squarefree. Then b = A000188(n) is the "inner square root" of n, c = A007913(n), LCM(b,c) = A007947(n) = "squarefree kernel" of n and bc = A019554(n) = "outer square root" of n.
a(n) = A128651(A129132(n-1) + 2) for n>1. - Reinhard Zumkeller, Mar 30 2007
Also the least common multiple of the prime factors of n. - Peter Luschny, Mar 22 2011
The Mobius transform of the sequence generates the sequence of absolute values of A097945. - R. J. Mathar, Apr 04 2011
|
|
|
REFERENCES
| J. Grytczuk, Thue type problems for graphs, points and numbers, Discrete Math., 308 (2008), 4419-4429.
S. Lang, Old and New Conjectured Diophantine Inequalities, Bull. Amer. Math. Soc., 23 (1990), 37-75. see p. 39.
|
|
|
LINKS
| Daniel Forgues, Table of n, a(n) for n=1..100000
H. Bottomley, Some Smarandache-type multiplicative sequences
S. R. Finch, Unitarism and infinitarism.
Neville Holmes, Integer Sequences
I. Peterson, The Amazing ABC Conjecture
Paul Tarau, Emulating Primality with Multiset Representations of Natural Numbers, in THEORETICAL ASPECTS OF COMPUTING, ICTAC 2011, Lecture Notes in Computer Science, 2011, Volume 6916/2011, 218-238
|
|
|
FORMULA
| n = Product (p_j^k_j) -> Product (p_j).
a(n) = Product(A027748(n,k): 1 <= k <= A001221(n)). [Reinhard Zumkeller, Aug 27 2011]
Dirichlet g.f.: zeta(s)*product_{primes p} (1+p^(1-s)-p^(-s)). - R. J. Mathar, Jan 21 2012
|
|
|
MAPLE
| with(numtheory); A007947 := proc(n) local i, t1, t2; t1 := ifactors(n)[2]; t2 := mul(t1[i][1], i=1..nops(t1)); end;
A007947 := n -> ilcm(op(numtheory[factorset](n))):
seq(A007947(i), i=1..69); # - Peter Luschny, Mar 22 2011
|
|
|
MATHEMATICA
| Prepend[ Array[ Times @@ First[ Transpose[ FactorInteger[ # ] ] ]&, 100, 2 ], 1 ]
|
|
|
PROG
| (PARI) a(n)=local(p); p=factor(n)[, 1]; prod(i=1, length(p), p[i])
(MAGMA) [ &*PrimeDivisors(n): n in [1..100] ]; [From Klaus Brockhaus, Dec 04 2008]
|
|
|
CROSSREFS
| Cf. A048803, A007913, A062953, A000188, A019554, A020500.
Bisection: A099984, A099985.
Sequence in context: A056554 A088835 * A015053 A062953 A015052 A053166
Adjacent sequences: A007944 A007945 A007946 * A007948 A007949 A007950
|
|
|
KEYWORD
| nonn,easy,nice,mult
|
|
|
AUTHOR
| R. Muller
|
|
|
EXTENSIONS
| More terms from several people including David W. Wilson (davidwwilson(AT)comcast.net).
|
| |
|
|
