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!)
A253560 Multiply n by its largest prime factor: a(n) = A006530(n) * n. 19
1, 4, 9, 8, 25, 18, 49, 16, 27, 50, 121, 36, 169, 98, 75, 32, 289, 54, 361, 100, 147, 242, 529, 72, 125, 338, 81, 196, 841, 150, 961, 64, 363, 578, 245, 108, 1369, 722, 507, 200, 1681, 294, 1849, 484, 225, 1058, 2209, 144, 343, 250, 867, 676, 2809, 162, 605, 392, 1083, 1682, 3481, 300, 3721, 1922, 441 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(1) = 1; for n > 1, a(n) = A006530(n) * n = A000040(A061395(n)) * n.
Other identities:
a(n) >= A253550(n) for all n >= 1.
a(n) = A129598(n) for all n >= 2.
A052126(a(n)) = n. [A052126 works as an inverse function for this injection.]
MATHEMATICA
a[n_] := n FactorInteger[n][[-1, 1]];
Array[a, 100] (* Jean-François Alcover, Feb 15 2021 *)
PROG
(Scheme) (define (A253560 n) (* (A006530 n) n))
(PARI) a(n) = if (n==1, 1, n*vecmax(factor(n)[, 1])); \\ Michel Marcus, Feb 15 2021
CROSSREFS
Essentially the same as A129598, except that here we have a(1) = 1.
Cf. A070003 (same sequence without 1, sorted into ascending order).
Differs from A072995 for the first time at n=15, where a(15) = 75, while A072995(15) = 225.
Sequence in context: A355012 A280286 A268597 * A050399 A072995 A354165
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 03 2015
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 April 25 07:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)