This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A253560 Multiply n by its largest prime factor: a(n) = A006530(n) * n. 13
 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 Antti Karttunen, Table of n, a(n) for n = 1..10000 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.] PROG (Scheme) (define (A253560 n) (* (A006530 n) n)) CROSSREFS Essentially the same as A129598, except that here we have a(1) = 1. Cf. A070003 (same sequence without 1, sorted into ascending order). Cf. A000040, A006530, A052126, A061395, A122111, A253550, A253561, A253563, A253565. Differs from A072995 for the first time at n=15, where a(15) = 75, while A072995(15) = 225. Sequence in context: A067666 A280286 A268597 * A050399 A072995 A073395 Adjacent sequences:  A253557 A253558 A253559 * A253561 A253562 A253563 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 23:02 EDT 2019. Contains 321565 sequences. (Running on oeis4.)